Tree Interval Queries

You are given a tree with $N$ vertices numbered $1, 2, \ldots, N$. First, you sort the adjacency lists of all the vertices and run depth first search from node $1$. This gives you an array of dfs start times. Note that the start times are uniquely determined, as the adjacency list of each vertex is sorted. The following code represents the dfs: ```cpp // let st denote the start times // l