C is the correct answer..because it may happen that we read vertex u(leaf node) and hit a dead end and backtracking to vertex y(say) then searching for possibilites we read v ..so it is nt the case that u,v must have any descendant relationship .. You can try with random graphs and arrive at the same conclusion