You are given a positive integer, n, representing the number of nodes in a tree, numbered from $0$ to $n-1$. You are also given a 2D integer array edges of length $n-1$, where edges[i] $= [u_i, v_i]$ indicates that there is a bidirectional edge connecting nodes $u_i$ and $v_i$.

You are also given a 2D integer array query of length $m$, where query[i] $= [start_i, end_i, node_i]$.

For each query i, find the node on the path between $start_i$ and $end_i$ ...