#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,MAX_LOG=20,INF=1<<30;
vector<pair<int,ll>> S[MAX];
int N,par[MAX_LOG][MAX],dis[MAX];
ll kyo[MAX];

void BFS(){
    for(int i=0;i<N;i++){
        dis[i]=-1;
        for(int j=0;j<20;j++){
            par[j][i]=-1;
        }
    }
    queue<int> Q;
    Q.push(0);
    dis[0]=0;
    kyo[0]=0;
    while(!Q.empty()){
        int a=Q.front();
        Q.pop();
        for(int i=0;i<S[a].size();i++){
            int b=S[a][i].first;ll c=S[a][i].second;
            if(dis[b]==-1){
                dis[b]=dis[a]+1;
                kyo[b]=kyo[a]+c;
                par[0][b]=a;
                Q.push(b);
            }
        }
    }
    return;
}

void init(){
    for(int k=0;k+1<MAX_LOG;k++){
        for(int i=0;i<N;i++){
            if(par[k][i]<0) par[k+1][i]=-1;
            else par[k+1][i]=par[k][par[k][i]];
        }
    }
}

int lca(int u,int v){
    if(dis[u]>dis[v]) swap(u,v);
    for(int i=0;i<20;i++){
        if(((dis[v]-dis[u])>>i)&1) v=par[i][v];
    }
    if(u==v)return u;
    
    for(int i=19;i>=0;i--){
        if(par[i][u]!=par[i][v]){
            u = par[i][u];
            v = par[i][v];
        }
    }
    return par[0][u];
}


int main(){

    cin>>N;
    for(int i=0;i<N-1;i++){
        int a,b;ll c;cin>>a>>b>>c;
        S[a].push_back({b,c});
        S[b].push_back({a,c});
    }
    
    BFS();
    init();
    
    int Q;cin>>Q;
    
    for(int i=0;i<Q;i++){
        int a,b,c;cin>>a>>b>>c;
        ll ans=0;
        ans+=kyo[a]+kyo[b]-2*kyo[lca(a,b)];
        ans+=kyo[b]+kyo[c]-2*kyo[lca(b,c)];
        ans+=kyo[c]+kyo[a]-2*kyo[lca(c,a)];
        cout<<ans/2<<endl;
    }
}