Querified

You are given a tree on $N$ vertices. The tree is rooted at vertex $R$. For each $u$ from $1$ to $N$, we define the value $G_u$ as follows: - $G_u$ is the **maximum** value of $\gcd(u, v)$ across all vertices $v \lt u$ that lie in the subtree$^\dagger$ of $u$. If no vertex with a label smaller than $u$ lies within its subtree, $G_u$ is defined to be $-1$ instead. Compute all the $N$ values $G_