#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll ne;

vector<ll> vn[800010];
ll par[60][800010];
ll dep[800010];
void lcadfs(ll v,ll p,ll d){
    par[0][v]=p;
    dep[v]=d;
    for(ll i=0;i<vn[v].size();i++){
        if(vn[v][i]!=p)lcadfs(vn[v][i],v,d+1);
    }
}
void lcainit(ll n){
    lcadfs(ne,-1,0);
    for(ll i=0;i<59;i++){
        for(ll j=0;j<n;j++){
            if(par[i][j]<0)par[i+1][j]=-1;
            else par[i+1][j]=par[i][par[i][j]];
        }
    }
}
ll lca(ll u,ll v){
    if(dep[u]>dep[v])swap(u,v);
    for(ll i=0;i<60;i++){
        if((dep[v]-dep[u])>>i&1)v=par[i][v];
    }
    if(u==v)return u;
    for(ll i=59;i>=0;i--){
        if(par[i][u]!=par[i][v]){
            u=par[i][u];
            v=par[i][v];
        }
    }
    return par[0][u];
}
int main(){
    ll n;cin>>n;
    vector<pll> v[n];
    ne=0;
    rep(i,0,n-1){
        ll a,b,c;cin>>a>>b>>c;
        vn[a].push_back(b);
        vn[b].push_back(a);
        v[a].push_back({b,c});
        v[b].push_back({a,c});
    }
    lcainit(n);
    ll d[n];
    fill(d,d+n,-1);
    d[0]=0;
    queue<ll> q;
    q.push(0);
    while(q.size()>0){
        ll now=q.front();
        q.pop();
        rep(i,0,v[now].size()){
            pll p=v[now][i];
            ll ne=p.first;
            ll co=p.second;
            if(d[ne]>=0)continue;
            d[ne]=d[now]+co;
            q.push(ne);
        }
    }
    ll qq;cin>>qq;
    rep(i,0,qq){
        ll x,y,z;cin>>x>>y>>z;
        ll s=lca(x,y);
        ll t=lca(y,z);
        ll u=lca(z,x);
        ll ans=d[x]+d[y]-2*d[s]+d[y]+d[z]-2*d[t]
        +d[z]+d[x]-2*d[u];
        cout<<ans/2<<endl;
    }
}