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≤i≤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≤j≤Q):

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

Constraints

* 3≤N≤10^5
* 1≤a_i,b_i≤N (1≤i≤N-1)
* 1≤c_i≤10^9 (1≤i≤N-1)
* The given graph is a tree.
* 1≤Q≤10^5
* 1≤K≤N
* 1≤x_j,y_j≤N (1≤j≤Q)
* x_j≠y_j (1≤j≤Q)
* x_j≠K,y_j≠K (1≤j≤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≤j≤Q), print the response to the j-th query.

Examples

Input

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


Output

3
2
4


Input

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


Output

5
14
22


Input

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


Output

17000000000
import java.util.*;

class Main{           
    
   public static void main(String[] args){
     
       Scanner sc = new Scanner(System.in);                                                          
       
       int n = sc.nextInt();
       
       List<List<Edge>> edges = new ArrayList<>(n);
       
       for(int i = 0 ;i < n;i++){
           edges.add(new ArrayList<>());
       }
       
       for(int i = 0;i < n-1;i++){
           int a = sc.nextInt()-1;
           int b = sc.nextInt()-1;
           int c = sc.nextInt();
           
           edges.get(a).add(new Edge(a,b,c));
           edges.get(b).add(new Edge(b,a,c));
       }
       
       int q = sc.nextInt();
       int k = sc.nextInt() - 1;

       int x[]=  new int[q];
       int y[] = new int[q];
              
       for(int i = 0;i < q;i++){
          x[i] = sc.nextInt() - 1;
          y[i] = sc.nextInt() - 1;           
       }
       
       
       long d[] = new long[n];
       
       boolean used[] = new boolean[n];
       
       Deque<Integer> st = new ArrayDeque<>();
       
       st.addLast(k);
       
       while(!st.isEmpty()){
           int e = st.pollFirst();
           
           used[e] = true;
           
           for(Edge next:edges.get(e)){
               if(used[next.v]){
                   continue;
               }
               
               d[next.v]= d[e] + next.w;
               
               st.addLast(next.v);
           }
           
       }
       
       
       for(int i = 0;i < q;i++){
           System.out.println(d[x[i]] + d[y[i]]);
       }
       
       
   }
   
   static class Edge{
       int u;
       int v;
       int w;
       
       Edge(int u,int v,int w){
           this.u = u;
           this.v = v;
           this.w = w;
       }       
   }
   
 }