Mr Gaurav is trying to solve one graph problem. The problem says, Given N nodes and N-1 edges connecting the nodes. There is a unique path between each pair of nodes. Each edge has some weight w. Q queries are given, for each query, find no of unique edge weights present in the path connecting u and v. Since Gaurav is President of CSS, he has got some urgent work. So, he asked you to solve the problem for him.

Input

First line of input contains a single integer N.

Next N-1 lines contains 3 space separated integer u, v, w representing an edge connecting u and v and having weight w.

Next line contains a single integer Q.

Next Q lines contains 2 space separated integer u and v.

Output

Print Q lines and each line should print one integer denoting the count of unique edges present in the path between u and v.

Constraints

2 ≤ N,Q ≤ 100 000

1 ≤ u,v ≤ 100 000

1 ≤ w ≤ 10

Setter : Sourav Kumar Paul