#include <iostream>
#include<bits/stdc++.h>
#define S second
#define F first
using namespace std;
typedef long long ll;
typedef pair<ll,ll>P;
ll n,m,a,b,c,dist[100000],parent[100000],depth[100000];
vector<P> v[100000];
void f(ll n,ll m,ll k){
    //cout<<n<<m<<k<<endl;
    dist[n]=m;
    depth[n]=k;
    for(auto x:v[n]){
        if(depth[x.F]!=0)continue;
        parent[x.F]=n;
        f(x.F,m+x.S,k+1);
    }
    return ;
}
ll LCA(ll n,ll m){
    while(depth[n]>depth[m])n=parent[n];
    while(depth[m]>depth[n])m=parent[m];
    while(n!=m){
        n=parent[n];
        m=parent[m];
    }
    return n;
}
ll func(ll a,ll b){
    return dist[a]+dist[b]-dist[LCA(a,b)]*2;
}
int main(void){
    cin>>n;
    for(int i=0;i<n-1;i++){
        cin>>a>>b>>c;
        v[a].push_back({b,c});
        v[b].push_back({a,c});
    }
    f(0,0,1);
    cin>>m;
    for(int i=0;i<m;i++){
        cin>>a>>b>>c;
        cout<<(func(a,b)+func(b,c)+func(c,a))/2<<endl;
    }
}