# include <bits/stdc++.h>
using namespace std;
int par[1000005][30];
int sum[1000005][30];
vector <pair <int,int> > g[1000005];
int level[1000005];
int maxlevel=0;
int k;
int ans=0;
int n;
void dfs(int v)
{
    int i,j;
    for(i=0;i<g[v].size();i++)
    {
        if(level[g[v][i].first]==0)
        {
            level[g[v][i].first]=level[v]+1;
            maxlevel=max(maxlevel,level[v]+1);
            par[g[v][i].first][0]=v;
            sum[g[v][i].first][0]=g[v][i].second;
            dfs(g[v][i].first);
        }
    }
}
void makelca()
{
    int i,j;
    for(i=1;(1<<i)<=maxlevel;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(par[j][i-1]!=-1)
            {
                     par[j][i] = par[par[j][i-1]][i-1];
                     sum[j][i] = sum[j][i-1]+sum[par[j][i-1]][i-1];
            }
            else
                par[j][i]=-1;
        }
    }
    k = i;
}
int findlca(int a, int b,int a1,int b1)
{

    if(level[a]<level[b]){swap(a,b);swap(a1,b1);}
   int i;
      // cout<<a<<" "<<b<<" "<<level[a]<<" "<<level[b]<<endl;
int dist = level[a]-level[b];
    while(dist>0)
    {
        i = log2(dist);

        ans+=a1*sum[a][i];
        a = par[a][i];
dist-=(1<<i);
    }

        if(a==b)return a;
    for(i=k;i>=0;i--)
    {//cout<<a<<" "<<b<<" "<<ans<<endl;
        if(par[a][i]!=-1&&par[a][i]!=par[b][i])
        {

            ans+=a1*sum[a][i];
            ans+=b1*sum[b][i];
            a=par[a][i];
            b=par[b][i];
        }
    }
    ans+=a1*sum[a][0];
    ans+=b1*sum[b][0];
    a = par[a][0];
    return a;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen ("meeting.in","r",stdin);
freopen ("meeting.out","w",stdout);
int i,j;
cin>>n;
int u,v,x;
for(i=1;i<n;i++)
{
    cin>>u>>v>>x;
    u++;
    v++;
    g[u].push_back({v,x});
    g[v].push_back({u,x});
    }
    level[1]=1;
    par[1][0]=-1;
dfs(1);
int q;
int A,B,C;
makelca();
cin>>q;
//cout<<maxlevel<<" "<<k<<endl;
int w1,w2,ans1,ans2;
int w;
while(q)
{
    q--;
    ans=0;
    cin>>A>>B>>C;
    A++;
    B++;
    C++;
     w = findlca(A,B,1,1);
   // cout<<w-1<<endl;
   //cout<<ans<<endl;
w = findlca(w,C,1,1);
w1 = w;
ans1 = ans;
ans=0;
w = findlca(A,B,1,1);
   // cout<<w-1<<endl;
   //cout<<ans<<endl;
w = findlca(B,C,1,1);
if(ans<ans1){w1=B;ans1=ans;}
ans=0;
w = findlca(A,B,1,1);
   // cout<<w-1<<endl;
   //cout<<ans<<endl;
w = findlca(A,C,1,1);
if(ans<ans1){w1=A;ans1=ans;}
ans=0;
w = findlca(C,B,1,1);
   // cout<<w-1<<endl;
   //cout<<ans<<endl;
w = findlca(A,C,1,1);
if(ans<ans1){w1=C;ans1=ans;}


cout<<w1-1<<" "<<ans1<<endl;
}


}