The editorial for D1 ( Easy version ) , I am facing difficulties understanding the editorial solution ...

Problem LINK : here

Note that because we guarantee that the root is a query, when we are computing the answer for any node 'v' in this DFS, we can assume that either 'v' or some vertex not in the subtree of 'v' has already been queried.

can someone elaborate little ?