Let's root of tree be node $$$1$$$. Then before queries for each node find out Ron will win or loose if he starts from it and first move is to one of it childs. Store the number of loosing childs of node $$$x$$$ in $$$dp1[x]$$$. If Rone starts on $$$x$$$ node, if $$$dp1[x] = 0$$$ he maybe win if he go to parent of $$$x$$$, else $$$x$$$ is winning and Ron has $$$dp1[x]$$$ childs to go in first move. Fore each query node $$$u$$$ if $$$dp1[u] \neq 1$$$ (Ron will win even if doesn't go to parent, i.e. move to one of $$$u$$$ childs on first move). Else only option to win is go to parent in Ron's first move. Let $$$p[u]$$$ be parent of $$$u$$$. Then Hermione wins if goes to loosing child (which is not $$$u$$$ cause it's activated) when $$$1 < dp1[p[u]]$$$ or $$$(dp1[p[u]] = 1$$$ and $$$dp2[p[u]] \neq u)$$$, else she has to go parent, and Ron will do these with $$$p[p[u]]$$$ too, and so on.

See the code too. I hope there's no problems with my explanation, if so please let me know.