输入描述:

The first line of input contains an integer n denoting the number of vertices.
The i-th line of the following n-1 lines contains two integers  denoting an edge connecting vertex  and vertex  (vertices are numbered from 0 to n-1).

The (n+1)-th line contains an integer Q denoting the number of queries.
The following Q lines each contains a query represented by three positive integers a, b, c.

* 

* 

输出描述:

For each query, if there exist three vertices X, Y, Z satisfying that the distance between X and Y is a, the distance between X and Z is b, and the distance between Y and Z is c, output one line containing three numbers indicating the index of X, Y, and Z. If there is no solution, please output only one integer -1 in a line. If there are multiple solutions, output any one.

5
0 1
2 1
3 1
3 4
4
2 2 2
1 1 1
1 2 3
1 3 1

0 2 3
-1
3 4 2
-1

For the first test, the simple path between 0 and 2 is 0-1-2, the simple path between 0 and 3 is 0-1-3, and the simple path between 2 and 3 is 2-1-3. All of them have a distance of 2.