#include<stdio.h>
#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef __int128 int128;
typedef __uint128_t uint128;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
bool mmp1;
char Buf[1<<23],*P1=Buf,*P2=Buf;
#define getchar() (P1==P2&&(P2=(P1=Buf)+fread(Buf,1,1<<23,stdin),P1==P2)?EOF:*P1++)
template<typename type>
inline void read(type &x)
{
	x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')
		ch=getchar();
	while(ch>='0'&&ch<='9')
		x=x*10+(ch^48),ch=getchar();
}
template<typename type,typename... args>
inline void read(type &x,args&... y)
{
	read(x),read(y...);
}
constexpr int Max=1e6+10,Size=2.1e7;
ll num[Max];
int val[Size],ls[Size],rs[Size];
int node_cnt;
inline int new_node(int p)
{
	int q=++node_cnt;
	val[q]=val[p],ls[q]=ls[p],rs[q]=rs[p];
	return q;
}
void insert(const int &x,int &p,int l,int r)
{
	p=new_node(p);
	++val[p];
	if(l==r)
		return;
	int mid=(l+r)>>1;
	if(x<=mid)
		insert(x,ls[p],l,mid);
	else
		insert(x,rs[p],mid+1,r);
}
ll seq[Max];
int len;
void dfs(int p1,int q1,int p2,int q2,int l,int r,int &k)//(p1 - q1) + (p2 - q2)
{
	const int now=val[p1]-val[q1]+val[p2]-val[q2];
	if(!k||!now)
		return;
	if(l==r)
	{
		for(int i=1;i<=now&&k;++i,--k)
			seq[++len]=num[l];
		return;
	}
	int mid=(l+r)>>1;
	dfs(rs[p1],rs[q1],rs[p2],rs[q2],mid+1,r,k);
	dfs(ls[p1],ls[q1],ls[p2],ls[q2],l,mid,k);
}
ll a[Max];
int n,m,lim;
vector<int>e[Max];
int fa[Max],siz[Max],son[Max],depth[Max],top[Max];
int rt[Max];
void init1(int u,int from)
{
	if(from)
		e[u].erase(find(all(e[u]),from));
	fa[u]=from,depth[u]=depth[from]+1,siz[u]=1;
	insert(a[u],rt[u]=rt[from],1,lim);
	for(auto v:e[u])
	{
		init1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>siz[son[u]])
			son[u]=v;
	}
}
void init2(int u,int t)
{
	top[u]=t;
	if(!son[u])
		return;
	init2(son[u],t);
	for(auto v:e[u])
		if(v!=son[u])
			init2(v,v);
}
inline int lca(int u,int v)
{
	while(top[u]!=top[v])
		if(depth[top[u]]>depth[top[v]])
			u=fa[top[u]];
		else
			v=fa[top[v]];
	return depth[u]<depth[v]?u:v;
}
ll tmp[Max];
bool mmp2;
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	read(n);
	for(int i=1,u,v;i<n;++i)
		read(u,v),e[u].push_back(v),e[v].push_back(u);
	for(int i=1;i<=n;++i)
		read(a[i]),num[i]=a[i];
	sort(num+1,num+n+1);
	lim=unique(num+1,num+n+1)-num-1;
	for(int i=1;i<=n;++i)
		a[i]=lower_bound(num+1,num+lim+1,a[i])-num;
	const int lg=__lg(num[lim]);
	init1(1,0);
	init2(1,1);
	int m,k,x,y,z;
	ll tx,ty;
	ll ans=0;
	read(m);
	while(m--)
	{
		read(tx,ty,k);
		x=(tx^ans)%n+1,y=(ty^ans)%n+1;
		z=lca(x,y);
		int w=(k-1)*(lg+1)+1;
		len=0;
		dfs(rt[x],rt[z],rt[y],rt[fa[z]],1,lim,w);
		ans=0;
		if(len>=k)
			for(int i=lg;~i;--i)
			{
				ll now=ans|1ll<<i;
				int cnt=0;
				for(int j=1;j<=len;++j)
					if((now&seq[j])==now)
						tmp[++cnt]=seq[j];
				if(cnt>=k)
				{
					ans=now;
					len=cnt;
					for(int i=1;i<=len;++i)
						seq[i]=tmp[i];
				}
			}
		cout<<ans<<"\n";
	}
	return 0;
}