#include<bits/stdc++.h>
#define pr pair<int,int>
#define eps 1e-10
#define int long long

using namespace std;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){x=(x*10+ch-'0');ch=getchar();}
	return x*f;
}

const int N=200005;
int head[N],to[N*2],nxt[N*2],cnt;
void add(int u,int v)
{
	to[++cnt]=v;
	nxt[cnt]=head[u];
	head[u]=cnt;
}

int n,q;
int fa[N],dep[N],lg[N],st[21][N],maxx[N],rt;
bool vis[N];
vector<int>awa,qwq[N];

void dfs(int now,int fath)
{
	dep[now]=dep[fath]+1;
	if(dep[now]>dep[rt])
		rt=now;
	fa[now]=fath;
	for(int i=head[now];i;i=nxt[i])
	{
		int v=to[i];
		if(v==fath||vis[v])
			continue;
		dfs(v,now);
	}
}

int a[4],p[4];

int query(int l,int r)
{
	int len=lg[r-l+1];
	return (maxx[st[len][l]]>maxx[st[len][r-(1<<len)+1]])?st[len][l]:st[len][r-(1<<len)+1];
}

void solve()
{
	n=read();
	for(int i=1;i<n;i++)
	{
		int u=read(),v=read();
		add(u,v),add(v,u);
	}
	rt=0;
	dfs(1,0);
	dfs(rt,0);
	while(rt)
		vis[rt]=1,awa.push_back(rt),rt=fa[rt];
	for(int i=2;i<=n;i++)
		lg[i]=lg[i>>1]+1;
	for(int i=0;i<(int)awa.size();i++)
	{
		rt=0;dep[0]=-1;
		dfs(awa[i],0);
		st[0][i+1]=i;
		maxx[i]=dep[rt];
		while(rt!=awa[i])
			qwq[i].push_back(rt),rt=fa[rt];
		qwq[i].push_back(rt);
		reverse(qwq[i].begin(),qwq[i].end()); 
	}
	int len=awa.size();
	for(int i=1;i<=20;i++)
		for(int j=1;j+(1<<i)-1<=len;j++)
			st[i][j]=(maxx[st[i-1][j]]>maxx[st[i-1][j+(1<<(i-1))]])?st[i-1][j]:st[i-1][j+(1<<(i-1))];
	q=read();
	while(q--)
	{
		for(int i=1;i<=3;i++)
			a[i]=read(),p[i]=i;
		sort(p+1,p+4,[&](int x,int y){return a[x]>a[y];});
		int u,v,w;
		int dis1=(a[p[2]]-a[p[3]]+a[p[1]])/2,dis2=a[p[1]]-dis1;
		int ovo=query(dis1+1,len-dis2);
		if(maxx[ovo]>=a[p[2]]-dis1)
		{
//            printf("!!!!%lld %lld\n",awa[ovo],maxx[ovo]);
			u=awa[ovo-dis1];
			v=awa[ovo+dis2];
			w=qwq[ovo][a[p[2]]-dis1];
		}
		else
		{
			ovo=query(dis2+1,len-dis1);
//			printf("!!!%lld %lld\n",awa[ovo],maxx[ovo]);
			u=awa[ovo+dis1];
			v=awa[ovo-dis2];
			w=qwq[ovo][a[p[2]]-dis1];
		}//(u,v) (u,w) (v,w)
		if(p[1]==1&&p[2]==2)
			printf("%lld %lld %lld\n",u,v,w);
		if(p[1]==1&&p[2]==3)
			printf("%lld %lld %lld\n",v,u,w);
		if(p[1]==2&&p[2]==1)
			printf("%lld %lld %lld\n",u,w,v);
		if(p[1]==2&&p[2]==3)
			printf("%lld %lld %lld\n",v,w,u);
		if(p[1]==3&&p[2]==1)
			printf("%lld %lld %lld\n",w,u,v);
		if(p[1]==3&&p[2]==2)
			printf("%lld %lld %lld\n",w,v,u);
	}
}

signed main() 
{
//	freopen("sum.in","r",stdin);
//	freopen("sum.out","w",stdout); 
	int Tests=1;
	while(Tests--)
		solve();
	return 0;
}