#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

template<class T>
struct LowestCommonAncestor {
private:
    const int LOG;
    vector<int> dep;
    const vector<vector<T>> &g;
    vector<vector<int>> table;
    
    void dfs(int idx, int par, int d) {
        table[0][idx] = par;
        dep[idx] = d;
        for(auto &to : g[idx]) {
            if(to != par) dfs(to, idx, d + 1);
        }
    }
    
public:
    LowestCommonAncestor(const vector<vector<T>> &g, int root) : g(g), dep(g.size()), LOG(32 - __builtin_clz(g.size())) {
        table.assign(LOG, vector<int>(g.size(), -1));
        dfs(root, -1, 0);
        for(int k = 0; k + 1 < LOG; k++) {
            for(int i = 0; i < table[k].size(); i++) {
                if(table[k][i] == -1) table[k + 1][i] = -1;
                else table[k + 1][i] = table[k][table[k][i]];
            }
        }
    }
    
    int query(int u, int v) {
        if(dep[u] > dep[v]) swap(u, v);
        for(int i = LOG - 1; i >= 0; i--) {
            if(((dep[v] - dep[u]) >> i) & 1) v = table[i][v];
        }
        if(u == v) return u;
        for(int i = LOG - 1; i >= 0; i--) {
            if(table[i][u] != table[i][v]) {
                u = table[i][u];
                v = table[i][v];
            }
        }
        return table[0][u];
    }
};

ll n;
vector<vector<pair<ll, ll>>> g;
vector<vector<ll>> gv;
vector<ll> dist;

void dfs(ll v, ll p = -1) {
    for(auto &x : g[v]) {
        ll u = x.first, cost = x.second;
        if (u == p) continue;
        if (dist[u] != -1) continue;
        dist[u] = dist[v] + cost;
        dfs(u, v);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ifstream in("input.txt");
    cin.rdbuf(in.rdbuf());
    cin >> n;
    g.resize(n);
    gv.resize(n);
    rep(i, n - 1) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        g[a].push_back(make_pair(b, c));
        g[b].push_back(make_pair(a, c));
        gv[a].push_back(b);
        gv[b].push_back(a);
    }
    dist.resize(n, -1);
    dist[0] = 0;
    dfs(0);
    LowestCommonAncestor<ll> lca(gv, 0);
    ll q;
    cin >> q;
    rep(i, q) {
        ll s, t;
        cin >> s >> t;
        s--; t--;
        ll v = lca.query(s, t);
        cout << (dist[s] + dist[t] - 2 * dist[v]) << endl;
    }
    return 0;
}