import java.util.*;

public class Main {
    static int n;
    static int[] depths;
    static int[][] parents;
    static int[] costs;
    static ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            graph.add(new HashMap<>());
        }
        for (int i = 0; i < n - 1; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            graph.get(a).put(b, c);
            graph.get(b).put(a, c);
        }
        depths = new int[n];
        parents = new int[30][n];
        costs = new int[n];
        setValue(0, 0, 0, 0);
        for (int i = 1; i < 30; i++) {
            for (int j = 0; j < n; j++) {
                parents[i][j] = parents[i - 1][parents[i - 1][j]];
            }
        }
        int q = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int s = sc.nextInt() - 1;
            int t = sc.nextInt() - 1;
            int lca = getLCA(s, t);
            long ans = (long)costs[s] - (long)costs[lca] * 2 + (long)costs[t];
            sb.append(ans).append("\n");
        }
        System.out.print(sb);
    }
    
    static int getLCA(int x, int y) {
        if (depths[x] < depths[y]) {
            return getLCA(y, x);
        }
        int def = depths[x] - depths[y];
        for (int i = 29; i >= 0 && depths[x] > depths[y]; i--) {
            if (def >= (1 << i)) {
                def -=(1 << i);
                x = parents[i][x];
            }
        }
        for (int i = 29; i >= 0; i--) {
            if (parents[i][x] == parents[i][y]) {
                continue;
            }
            x = parents[i][x];
            y = parents[i][y];
        }
        if (x != y) {
            return parents[0][x];
        } else {
            return x;
        }
    }
    
    static void setValue(int idx, int p, int d, int c) {
        depths[idx] = d;
        parents[0][idx] = p;
        costs[idx] = c;
        for (int x : graph.get(idx).keySet()) {
            if (x == p) {
                continue;
            }
            setValue(x, idx, d + 1, c + graph.get(idx).get(x));
        }
    }
}