#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
bool fl[100001];
long long n,m,j,v1,v2,v3,vr2,br,fa[100001],b[100001][20],dd=1,logg,lg,s1,s2,l,r,v33,v44,v55,raz,s[100001],ans;
vector <long long> v[100001];
vector <long long> vv[100001];
pair <long long,long long> a[200001];
void rec(long long vr,long long d){
	int i;
	//cout<<vr<<" "<<s[vr]<<endl;
	
	fl[vr]=1;
	a[++br].first=d;
	a[br].second=vr;
	fa[vr]=br;//first appearence
	for(i=0;i<v[vr].size();i++){
		vr2=v[vr][i];
		if(!fl[vr2]){
			s[vr2]=s[vr]+vv[vr][i];
			rec(vr2,d+1);	
			a[++br].first=d;
			a[br].second=vr;
		}
	}
}

long long log2(long long p){
	logg=0;
	while(p>=2){
		p/=2;
		logg++;
	}
	return logg;
}
int main(){
int i,j;
freopen("meeting.in","rt",stdin);
freopen("meeting.out","wt",stdout);
cin>>n;
for(i=1;i<n;i++){
	scanf("%lld %lld %lld",&v1,&v2,&raz);
	v1++;
	v2++;
	v[v1].push_back(v2);
	v[v2].push_back(v1);
	vv[v1].push_back(raz);
	vv[v2].push_back(raz);
}
/*cout<<endl;
for(i=1;i<=n;i++){
	for(j=0;j<vv[i].size();j++)cout<<vv[i][j]<<" "; cout<<endl;
}*/
//cout<<endl;
rec(1,1);
lg=log2(br);
for(j=0;j<=lg;j++){
	//cout<<dd<<endl;
	for(i=1;i<=br;i++){
		if(i+dd-1>br)break;
		if(j==0)b[i][j]=i;
		else{
			s1=a[b[i][j-1]].first;
			s2=a[b[i+dd/2][j-1]].first;
			if(s1<s2)b[i][j]=b[i][j-1];
			else b[i][j]=b[i+dd/2][j-1];
		}
		//cout<<i<<" "<<i+dd-1<<" "<<b[i][j]<<endl;
	}
	//cout<<endl;
	dd*=2;
}//
/*for(i=1;i<=br;i++)cout<<a[i].first<<" ";
cout<<endl;

for(i=1;i<=br;i++)cout<<a[i].second<<" ";
cout<<endl;

for(i=1;i<=n;i++)cout<<s[i]<<" ";
cout<<endl;*/

cin>>m;
for(i=1;i<=m;i++){
	scanf("%lld %lld %lld",&v1,&v2,&v3);
	v1++;
	v2++;
	v3++;
	l=fa[v1];
	r=fa[v2];
	if(l>r)swap(l,r);
	lg=log2(r-l+1);
	s1=a[b[l][lg]].first;
	s2=a[b[r-(1<<lg)+1][lg]].first;
	if(s1<s2) v33=a[b[l][lg]].second;
	else v33=a[b[r-(1<<lg)+1][lg]].second;
	//cout<<v1<<" "<<v2<<" "<<v33<<"!!!"<<endl;
	
	l=fa[v1];
	r=fa[v3];
	if(l>r)swap(l,r);
	lg=log2(r-l+1);
	s1=a[b[l][lg]].first;
	s2=a[b[r-(1<<lg)+1][lg]].first;
	if(s1<s2) v44=a[b[l][lg]].second;
	else v44=a[b[r-(1<<lg)+1][lg]].second;
	//cout<<v1<<" "<<v3<<" "<<v44<<"!!!"<<endl;
	
	l=fa[v2];
	r=fa[v3];
	if(l>r)swap(l,r);
	lg=log2(r-l+1);
	s1=a[b[l][lg]].first;
	s2=a[b[r-(1<<lg)+1][lg]].first;
	if(s1<s2) v55=a[b[l][lg]].second;
	else v55=a[b[r-(1<<lg)+1][lg]].second;
	//cout<<v2<<" "<<v3<<" "<<v55<<"!!!"<<endl;
	//cout<<l<<" "<<r<<" "<<lg<<" "<<b[l][lg]<<" "s1<<"  "<<s2<<endl;
	
	//cout<<v33-1<<" "<<v44-1<<" "<<v55-1<<endl;
	ans=s[v1]+s[v2]+s[v3];
	//cout<<ans<<endl;
	if(v33==v44){
		cout<<v55-1<<" ";
		ans-=(s[v55]+2*s[v33]);
	}
	else{
		if(v33==v55){
			cout<<v44-1<<" ";
			ans-=(s[v44]+2*s[v33]);
		}
		else{
			cout<<v33-1<<" ";
			ans-=(s[v33]+2*s[v44]);
		}	
	}
	cout<<ans<<endl;
}
return 0;
}
/*
6 4 
1 2
1 3
2 4
2 5
3 6
5 1
4 6
5 3
4 5


8
0 1 10
0 2 13
2 5 27
2 3 5
2 4 8
3 6 4
3 7 1
5
3 4 5
1 0 7
1 5 4
1 7 4
1 6 4
*/