Score : $400$ points

Problem Statement

You are given a tree with $N$ vertices. Here, a tree is a kind of graph, and more specifically, a connected undirected graph with $N-1$ edges, where $N$ is the number of its vertices. The $i$-th edge $(1 \leq i \leq N-1)$ connects Vertices $a_i$ and $b_i$, and has a length of $c_i$.

You are also given $Q$ queries and an integer $K$. In the $j$-th query $(1 \leq j \leq Q)$:

• find the length of the shortest path from Vertex $x_j$ and Vertex $y_j$ via Vertex $K$.

Constraints

• $3 \leq N \leq 10^5$
• $1 \leq a_i,b_i \leq N (1 \leq i \leq N-1)$
• $1 \leq c_i \leq 10^9 (1 \leq i \leq N-1)$
• The given graph is a tree.
• $1 \leq Q \leq 10^5$
• $1 \leq K \leq N$
• $1 \leq x_j,y_j \leq N (1 \leq j \leq Q)$
• $x_j \neq y_j (1 \leq j \leq Q)$
• $x_j \neq K,y_j \neq K (1 \leq j \leq Q)$

Input

Input is given from Standard Input in the following format:

$N$

$a_1$ $b_1$ $c_1$

$:$

$a_{N-1}$ $b_{N-1}$ $c_{N-1}$

$Q$ $K$

$x_1$ $y_1$

$:$

$x_{Q}$ $y_{Q}$

Output

Print the responses to the queries in $Q$ lines. In the $j$-th line $j(1 \leq j \leq Q)$, print the response to the $j$-th query.

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

3
2
4

The shortest paths for the three queries are as follows:

• Query $1$: Vertex $2$ → Vertex $1$ → Vertex $2$ → Vertex $4$ : Length $1+1+1=3$
• Query $2$: Vertex $2$ → Vertex $1$ → Vertex $3$ : Length $1+1=2$
• Query $3$: Vertex $4$ → Vertex $2$ → Vertex $1$ → Vertex $3$ → Vertex $5$ : Length $1+1+1+1=4$

7
1 2 1
1 3 3
1 4 5
1 5 7
1 6 9
1 7 11
3 2
1 3
4 5
6 7

5
14
22

The path for each query must pass Vertex $K=2$.

10
1 2 1000000000
2 3 1000000000
3 4 1000000000
4 5 1000000000
5 6 1000000000
6 7 1000000000
7 8 1000000000
8 9 1000000000
9 10 1000000000
1 1
9 10

17000000000