#include<iostream>
#include<vector>
using namespace std;
int N;
vector<pair<int,int> >G[1<<17];
int depth[1<<17];
long weighth[1<<17];
int parent[17][1<<17];
void dfs(int u,int p,int d,long wei)
{
	depth[u]=d;
	weighth[u]=wei;
	parent[0][u]=p;
	for(pair<int,int>q:G[u])
	{
		if(q.first==p)continue;
		dfs(q.first,u,d+1,wei+q.second);
	}
}
int lca(int u,int v)
{
	if(depth[u]>depth[v])swap(u,v);
	for(int k=16;k>=0;k--)
	{
		if(depth[v]-depth[u]>>k&1)v=parent[k][v];
	}
	if(u==v)return u;
	for(int k=16;k>=0;k--)
	{
		if(parent[k][u]!=parent[k][v])
		{
			u=parent[k][u];
			v=parent[k][v];
		}
	}
	return parent[0][u];
}
main()
{
	cin>>N;
	for(int i=1;i<N;i++)
	{
		int u,v,w;cin>>u>>v>>w;
		G[u].push_back(make_pair(v,w));
		G[v].push_back(make_pair(u,w));
	}
	dfs(0,-1,0,0);
	for(int k=1;k<17;k++)
	{
		for(int i=0;i<N;i++)
		{
			if(parent[k-1][i]>=0)parent[k][i]=parent[k-1][parent[k-1][i]];
			else parent[k][i]=-1;
		}
	}
	int Q;
	cin>>Q;
	for(;Q--;)
	{
		int x,y,z;cin>>x>>y>>z;
		int xy=lca(x,y);
		int yz=lca(y,z);
		int zx=lca(z,x);
		cout<<weighth[x]+weighth[y]+weighth[z]-weighth[xy]-weighth[yz]-weighth[zx]<<endl;
	}
}