The only difference between SHAM and DHAM, in SHAM |V| is divisible by $3$ which can be check in constant amount of time.
S,o the hardness of the two problem will the same. Next, finding hamiltonian cycle comes under NPC problem and NPC problem is a subset of NPH, so both are NPH.
So, option (A).