Finding a Tree Connected Component

A tree with $N$ vertices and $N-1$ undirected edges is given. Vertices are numbered from $0$ to $N-1$, and vertex $0$ is the root. Perform the following query $Q$ times.

• $k$ $v_1$ $v_2$ ... $v_k$: Let $C$ be the connected component with the fewest vertices that contains all $k$ vertices $v_1, v_2, ..., v_k$. Print the number of vertices in $C$ and the sum of the vertex numbers in $C$, separated by a space.

The first line contains $N$. ($2 \le N \le 100000$)

The next $N-1$ lines each contain a parent vertex $p$ and a child vertex $c$, separated by a space. The given graph is a tree. ($0 \le p \le N-1$, $0 \le c \le N-1$, $p \ne c$)

The next line contains $Q$. ($1 \le Q \le 100000$)

The next $Q$ lines each contain $k, v_1, v_2, ..., v_k$, separated by spaces. The sum of all $k$ is at most $10^6$. ($1 \le k \le N$, $0 \le v_i \le N-1$ ($1 \le i \le k$), $v_i \ne v_j$ ($1 \le i < j \le k$))

All numbers in the input are integers.

For each query, print the answer on its own line.