#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
typedef long long int ull;
#define MP make_pair
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
// const ll MOD = 998244353;
const ll MOD = 1000000007;
// using mint = modint998244353;
using mint = modint1000000007;
const double pi = 3.1415926536;
const int MAX = 2000003;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm (ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n) {
    ll ret = 0;
    while (n) {
        n /= 10;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}

vector<P> e[100001];
int db[100001][18];
int dep[100001];
ll ct[100001];

void dfs(int par, int cur, int de, ll cst) {
    db[cur][0] = par;
    dep[cur] = de;
    ct[cur] = cst;
    for (auto x : e[cur]) {
        if (x.first == par) continue;
        dfs(cur, x.first, de + 1, cst + x.second);
    }
}
int anc(int pos, int num) {
    int now = pos;
    for (int i = 0; i < 18; i++) {
        if ((num >> i) & 1) {
            now = db[now][i];
        }
    }
    return now;
}
int com_anc(int x, int y) {
    int nx = x;
    int ny = y;
    if (dep[nx] > dep[ny]) {
        nx = anc(nx, dep[nx] - dep[ny]);
    }
    else if (dep[nx] < dep[ny]) {
        ny = anc(ny, dep[ny] - dep[nx]);
    }
    // cout << "hi " << x << ' ' << y << ' ' << nx << ' ' << ny << endl;
    int M = 100001;
    int m = -1;
    while (M - m > 1) {
        int mid = (M + m) / 2;
        if (anc(nx, mid) == anc(ny, mid)) {
            M = mid;
        }
        else {
            m = mid;
        }
    }
    return anc(nx, M);
}
int dist(int x, int y) {
    return ct[x] + ct[y] - 2 * ct[com_anc(x, y)];
}
int main() {
    int n;
    cin >> n;
    for (int i = 0; i <= n - 2; i++) {
        ll u, v, w;
        cin >> u >> v >> w;
        e[u].push_back(P(v, w));
        e[v].push_back(P(u, w));
    }
    dfs(0, 0, 0, 0);
    for (int j = 1; j < 18; j++) {
        for (int i = 0; i < n; i++) {
            db[i][j] = db[db[i][j - 1]][j - 1];
        }
    }
    int q;
    cin >> q;
    for (int i = 0; i <= q - 1; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        cout << (dist(x, y) + dist(y, z) + dist(z, x)) / 2 << endl;
    }
    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < n; j++) {
    //         cout << i << ' ' << j << ' ' << com_anc(i, j) << endl;
    //     }
    // }
    return 0;
}