#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<int, ll>;

struct LCA {
    using Graph = vector< vector<P> >;

    const Graph& g;
    const int LOGV;
    const int root;

    vector< vector<int> > parent;
    vector<int> depth;
    vector<ll> weights;

    LCA(const Graph& g, int root = 0) : g(g), LOGV(32 - __builtin_clz(g.size())), root(root) {
        int V = g.size();
        parent.resize(LOGV, vector<int>(V));
        depth.resize(V);
        weights.resize(V);

        dfs(root, -1, 0, 0);
        for (int k = 0; k + 1 < LOGV; k++) {
            for (int v = 0; v < V; v++) {
                if (parent[k][v] < 0) parent[k + 1][v] = -1;
                else parent[k + 1][v] = parent[k][parent[k][v]];
            }
        }
    }

    void dfs(int v, int p, int d, ll w) {
        parent[0][v] = p;
        depth[v] = d;
        weights[v] = w;
        for (const P& e : g[v]) {
            if (e.first != p) dfs(e.first, v, d + 1, w + e.second);
        }
    }

    int operator()(int u, int v) const {
        if (depth[u] > depth[v]) swap(u, v);
        for (int k = 0; k < LOGV; k++) {
            if ((depth[v] - depth[u]) >> k & 1) {
                v = parent[k][v];
            }
        }
        if (u == v) return u;
        for (int k = LOGV - 1; k >= 0; k--) {
            if (parent[k][u] != parent[k][v]) {
                u = parent[k][u];
                v = parent[k][v];
            }
        }
        return parent[0][u];
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector< vector<P> > G(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        ll w;
        cin >> u >> v >> w;
        G[u].emplace_back(v, w);
        G[v].emplace_back(u, w);
    }

    LCA lca(G);
    const vector<int>& depth = lca.depth;
    const vector<ll>& weights = lca.weights;

    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        int xy = lca(x, y);
        int yz = lca(y, z);
        int zx = lca(z, x);

        int tar = xy;
        int hoge = lca(xy, z);
        ll ans = weights[x] + weights[y] - weights[xy] * 2;
        ans += weights[z] + weights[xy] - weights[hoge] * 2;
        if (depth[tar] < depth[yz]) {
            tar = yz;
            ans = weights[y] + weights[z] - weights[yz] * 2;
            ans += weights[x] + weights[yz] - weights[hoge] * 2;
        }
        if (depth[tar] < depth[zx]) {
            tar = zx;
            ans = weights[z] + weights[x] - weights[zx] * 2;
            ans += weights[y] + weights[zx] - weights[hoge] * 2;
        }
        
        cout << ans << "\n";
    }
    return 0;
}