#include<bits/stdc++.h>

using namespace std;

ifstream fin("meeting.in");
ofstream fout("meeting.out");

struct edge
{
    int ver, dist;
    edge() { }
    edge(int ver, int  dist) :ver(ver), dist(dist) { }
    bool operator< (const edge &e) const
    {
        return dist<e.dist;
    }
};

const int nmax=1000010;
int n;
vector<edge> v[nmax];
unsigned d[nmax];
bool used[nmax];
int xar[nmax], yar[nmax], zar[nmax];
int sum;

void dfs(int i)
{
    d[i]=sum;
    used[i]=1;
    int sz=v[i].size();
    for(int j=0; j<sz; ++j)
        if(!used[v[i][j].ver])
        {
            int psum=sum;
            sum+=v[i][j].dist;
            dfs(v[i][j].ver);
            sum=psum;
        }
}

void read()
{
    int x, y, dis;
    fin>>n;
    for(int i=0; i<n-1; ++i)
    {
        fin>>x>>y>>dis;
        v[x].push_back(edge(y, dis));
        v[y].push_back(edge(x, dis));
    }
}

void solve()
{
    int q1, tsum, ans;
    int x1, y1, z1;
    fin>>q1;
    for(int i=0; i<q1; ++i)
    {
        fin>>x1>>y1>>z1;
        sum=0;
        dfs(x1);
        memset(used, 0, sizeof(used));
        for(int j=0; j<n; ++j) xar[j]=d[j];
        sum=0;
        dfs(y1);
        memset(used, 0, sizeof(used));
        for(int j=0; j<n; ++j) yar[j]=d[j];
        sum=0;
        dfs(z1);
        memset(used, 0, sizeof(used));
        for(int j=0; j<n; ++j) zar[j]=d[j];
        tsum=10000000;
        for(int j=0; j<n; ++j)
        {
            if(xar[j]+yar[j]+zar[j]<tsum)
                tsum=xar[j]+yar[j]+zar[j], ans=j;
        }
        fout<<ans<<" "<<tsum<<endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    fin.tie(0);
    fout.tie(0);
    read();
    solve();
	return 0;
}