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.*;

public class Main {
    static int modP = 1000000007;
    static long inf  = Long.MAX_VALUE;
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Map<Integer, List<E>> map = new HashMap<>();
        for(int i = 0; i < n-1; i++) {
            int a = in.nextInt()-1;
            int b = in.nextInt()-1;
            int c = in.nextInt();

            List<E> leftList = map.containsKey(a) ? map.get(a) : new LinkedList<>();
            E atob = new E(a,b,c);
            leftList.add(atob);
            map.put(a, leftList);
            List<E> rightList = map.containsKey(b) ? map.get(b) : new LinkedList<>();
            E btoa = new E(b,a,c);
            rightList.add(btoa);
            map.put(b, rightList);
        }
        int q = in.nextInt();
        int k = in.nextInt()-1;
        List<Q> queries = new ArrayList<>();
        for(int i = 0; i < q; i++) {
            int x = in.nextInt()-1;
            int y = in.nextInt()-1;
            Q query = new Q(x,y);
            queries.add(query);
        }

        long[] dist = new long[n];
        Arrays.fill(dist, inf);

        dist[k] = 0;
        Stack<Integer> stack = new Stack<>();
        stack.push(k);
        while(!stack.isEmpty()) {
            int currentNode = stack.pop();
            List<E> edges = map.get(currentNode);
            for(E e : edges) {
                if(dist[e.to] != inf) continue;

                stack.push(e.to);
                dist[e.to] = dist[currentNode] + e.w;
            }
        }

        for(int i = 0; i < q; i++) {
            int x = queries.get(i).x;
            int y = queries.get(i).y;
            print(dist[x] + dist[y]);
        }
    }

    static void print(String s) {
        System.out.println(s);
    }

    static void print(int i) {
        System.out.println(i);
    }

    static void print(long i) {
        System.out.println(i);
    }
}

class Q {
    int x, y;
    Q(int x, int y) {
        this.x = x;
        this.y = y;
    }
}

class E {
    int from, to;
    long w;
    E(int from, int to, long w) {
        this.from = from;
        this.to = to;
        this.w = w;
    }
}