#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define rint int
#define endl '\n'
int read(){
	int x=0,f=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)) x=x*10+c-48,c=getchar();
	return x*f;
}const int N=2e5+10,p=1e9;

int n,m;
vector<int> e[N];
struct Val{
	int x,id;
	bool operator <(const Val &A)const{return x>A.x;}
};
struct data{
	Val x,y,z;
	void operator+=(const Val &A)
	{
		if(A<x) z=y,y=x,x=A;
		else if(A<y) z=y,y=A;
		else if(A<z) z=A;
	}
}d[N];
void dfs(int x=1,int fa=1)
{
	d[x]={0,x,-p,0,-p,0};
	for(auto &it:e[x])
	if(it!=fa)
	{
		dfs(it,x);
		Val res=d[it].x;
		res.x++,d[x]+=res;
	}
}
Val sum[N],suf[N];
void sel(int x=1,int fa=1,Val res={-p,0})
{
	res.x++,d[x]+=res;
	int sz=e[x].size();Val tmp;
	for(rint i=0;i<sz;i++) tmp=d[e[x][i]].x,tmp.x++,sum[e[x][i]]=suf[e[x][i]]=(e[x][i]==fa?res:min(tmp,res));
	for(rint i=1;i<sz;i++)  sum[e[x][i]]=min(sum[e[x][i]],sum[e[x][i-1]]);
	for(rint i=sz-2;~i;i--) suf[e[x][i]]=min(suf[e[x][i]],suf[e[x][i+1]]);
	if(sz==1) return;
	if(e[x][0]!=fa)	   sel(e[x][0],x,suf[e[x][1]]);
	if(e[x][sz-1]!=fa) sel(e[x][sz-1],x,sum[e[x][sz-2]]);
	for(rint i=1;i+1<sz;i++)
	if(e[x][i]!=fa) sel(e[x][i],x,min(sum[e[x][i-1]],suf[e[x][i+1]]));
}

int mm;
struct node{
	int x,y,z,id,how;
}q[N];
struct cmp{
	bool operator ()(const node &A,const node &B){return A.z<B.z;}
};
bool cmpx(const node &A,const node &B){return A.x!=B.x?A.x<B.x:A.how>B.how;}
bool cmpy(const node &A,const node &B){return A.y!=B.y?A.y<B.y:A.how>B.how;}
multiset<node,cmp> s;
vector<node> ve[N];
bool use[N];
void cdq(int l=1,int r=mm)
{
	if(l==r) return;
	int mid=(l+r)>>1;
	cdq(l,mid);
	sort(q+l,q+mid+1,cmpy),sort(q+mid+1,q+r+1,cmpy);
	for(rint i=l,j=mid+1;j<=r;j++)
	{
		while(i<=mid&&q[i].y<=q[j].y){
			if(q[i].how&&!use[q[i].id]) s.insert(q[i]);
			i++;
		}
		if(!q[j].how)
		{
			auto it=s.upper_bound(q[j]);
			while(it!=s.begin())
			{
				--it;
				ve[q[j].id].push_back(*it),use[it->id]=1;
				it=s.erase(it);
			}
		}
	}
	s.clear();
	cdq(mid+1,r);
}

void init()
{
	dfs(),sel();
//	for(rint i=1;i<=n;i++) 
//		cout<<i<<":("<<d[i].x.x<<" "<<d[i].x.id<<") "
//		<<"("<<d[i].y.x<<" "<<d[i].y.id<<") "
//		<<"("<<d[i].z.x<<" "<<d[i].z.id<<")"<<endl;
	mm=m;
	for(rint i=1;i<=n;i++) q[++mm]={d[i].x.x,d[i].y.x,d[i].z.x,i,0};
	cdq();
//	for(rint i=1;i<=n;i++)
//	{
//		cout<<i<<": ";
//		for(auto &it:ve[i]) cout<<it.id<<" ";cout<<endl;
//	}
}

int FA[N],D[N],sz[N],son[N];
int dfn[N],tot,top[N],o[N];
void dfs1(int x=1,int fa=0,int dep=1)
{
	FA[x]=fa,D[x]=dep,sz[x]=1;
	for(auto &it:e[x])
	if(it!=fa)
	{
		dfs1(it,x,dep+1),sz[x]+=sz[it];
		if(sz[son[x]]<sz[it]) son[x]=it;
	}
}
void dfs2(int x=1,int tp=1)
{
	dfn[x]=++tot,top[x]=tp,o[tot]=x;
	if(!son[x]) return;
	dfs2(son[x],tp);
	for(auto &it:e[x])
	if(!dfn[it]) dfs2(it,it);
}

int ask(int l,int r,int dep)
{
	int x=l,y=r,fa;
	while(top[x]!=top[y])
	{
		if(D[top[x]]<D[top[y]]) swap(x,y);
		x=FA[top[x]];
	}
	if(D[x]>D[y]) fa=y;
	else fa=x;
//	cout<<"ask "<<l<<" "<<r<<" "<<fa<<" "<<dep<<endl;
	if(D[l]-dep>=D[fa])
	{
		int tar=D[l]-dep;
		while(D[top[l]]>tar) l=FA[top[l]];
		return o[dfn[l]-(D[l]-tar)];
	}
	else
	{
		int tar=D[fa]+dep-(D[l]-D[fa]);
		while(D[top[r]]>tar) r=FA[top[r]];
		return o[dfn[r]-(D[r]-tar)];
	}
}

struct ANS{
	int x,y,z;
}ans[N];

void work()
{
	dfs1(),dfs2();
	for(rint i=1;i<=n;i++)
	for(auto &it:ve[i])
		ans[it.id]={ask(i,d[i].x.id,it.x),ask(i,d[i].y.id,it.y),ask(i,d[i].z.id,it.z)};
	for(rint i=1;i<=m;i++) cout<<ans[i].x<<" "<<ans[i].y<<" "<<ans[i].z<<endl;
}

signed main()
{
//	ios::sync_with_stdio(0);
	n=read();
	for(rint i=1;i<n;i++)
	{
		int x=read(),y=read();
		e[x].push_back(y),e[y].push_back(x);
	}
	m=read();
	for(rint i=1;i<=m;i++)
	{
		int x=read(),y=read(),z=read();
		q[i]={(x-y+z)>>1,(x+y-z)>>1,(y+z-x)>>1,i,1};
		if(q[i].y>q[i].x) swap(q[i].y,q[i].x);
		if(q[i].z>q[i].y) swap(q[i].z,q[i].y);
		if(q[i].y>q[i].x) swap(q[i].y,q[i].x);
//		cout<<"q "<<i<<" "<<q[i].x<<" "<<q[i].y<<" "<<q[i].z<<endl;
	}
	init();
	work();
	return 0;
}