#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*4+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,k;vector<int> S[N];
int fa[N],tp[N],d[N],siz[N],son[N];
ll val[N],ns[N];int nh,rt[N];
vector<int> ad;
namespace Tree{
	int f[N*20],L[N*20],R[N*20],Ct;
	void cp(int &v){f[++Ct]=f[v];L[Ct]=L[v];R[Ct]=R[v];v=Ct;}
	void add(int x,int &v,int l=1,int r=nh){
		cp(v);f[v]++;if(l==r) return;int m=l+r>>1;
		x<=m?add(x,L[v],l,m):add(x,R[v],m+1,r);
	}
	int qry(int x,int y,int v,int l=1,int r=nh){
		if(x>y) return 0;if(x<=l&&r<=y) return f[v];
		int m=l+r>>1;return (x<=m?qry(x,y,L[v],l,m):0)+(y>m?qry(x,y,R[v],m+1,r):0);
	}
	void find(int x,int y,int v1,int v2,int v3,int v4,int l=1,int r=nh){
		int w=f[v1]+f[v2]-f[v3]-f[v4];if(!w||x>y) return;
		if(l==r) {while(w--) ad.emplace_back(l);return;}
		int m=l+r>>1;x<=m&&(find(x,y,L[v1],L[v2],L[v3],L[v4],l,m),0);y>m&&(find(x,y,R[v1],R[v2],R[v3],R[v4],m+1,r),0);
	}
}
void find(ll x,ll y,int v1,int v2,int v3,int v4){
	ad.clear();x=LB(ns+1,ns+nh+1,x)-ns;y=UB(ns+1,ns+nh+1,y)-ns-1;
	Tree::find(x,y,v1,v2,v3,v4);
}
int qry(ll x,ll y,int v){
	x=LB(ns+1,ns+nh+1,x)-ns;y=UB(ns+1,ns+nh+1,y)-ns-1;
	return Tree::qry(x,y,v);
}
void dfs1(int x,int La){
	fa[x]=La;d[x]=d[La]+1;siz[x]=1;rt[x]=rt[La];Tree::add(val[x],rt[x]);
	for(int i:S[x]) if(i^La) dfs1(i,x),siz[x]+=siz[i],siz[i]>siz[son[x]]&&(son[x]=i);
}
void dfs2(int x,int La){
	tp[x]=La;if(son[x]) dfs2(son[x],La);
	for(int i:S[x]) if(i^fa[x]&&i^son[x]) dfs2(i,i);
}
int lca(int x,int y){
	while(tp[x]^tp[y]) {
		if(d[tp[x]]<d[tp[y]]) swap(x,y);
		x=fa[tp[x]];
	}
	return d[x]<d[y]?x:y;
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<n;i++){
		int x,y;scanf("%d%d",&x,&y);
		S[x].emplace_back(y);S[y].emplace_back(x);
	}
	for(i=1;i<=n;i++) scanf("%lld",&val[i]),ns[++nh]=val[i];
	sort(ns+1,ns+nh+1);nh=unique(ns+1,ns+nh+1)-ns-1;for(i=1;i<=n;i++) val[i]=LB(ns+1,ns+nh+1,val[i])-ns;
	dfs1(1,0);dfs2(1,1);
	ll LA=0;int q;scanf("%d",&q);while(q--){
		int x,y;scanf("%d%d%d",&x,&y,&k);x=(x^LA)%n+1;y=(y^LA)%n+1;
		int Ls=lca(x,y);
		multiset<ll> f;
		ll ans=0;for(i=61;~i;i--){
			int w=qry(ans+(1ll<<i),ans+(1ll<<i+1)-1,rt[x])+qry(ans+(1ll<<i),ans+(1ll<<i+1)-1,rt[y]);
			w-=qry(ans+(1ll<<i),ans+(1ll<<i+1)-1,rt[Ls])+qry(ans+(1ll<<i),ans+(1ll<<i+1)-1,rt[fa[Ls]]);
			vector<int> del;
			while(w<k&&!f.empty()&&(*f.rbegin())>>i&1) del.emplace_back(*f.rbegin()),f.erase(--f.end()),w++;
			// cerr<<i<<' '<<(f.empty()?-1:*f.begin())<<' '<<w<<'\n';
			if(w>=k) {
				ans|=1ll<<i;
				for(int j:del) f.emplace(j);
				while(!f.empty()&&~*f.begin()>>i&1) f.erase(f.begin());
			}else{
				for(int j:del) f.emplace(j^(1ll<<i));
				find(ans+(1ll<<i),ans+(1ll<<i+1)-1,rt[x],rt[y],rt[Ls],rt[fa[Ls]]);
				for(int j:ad) f.emplace(ns[j]^(1ll<<i))/*,cerr<<"add "<<i<<' '<<j<<'\n'*/;
			}
		}
		printf("%lld\n",LA=ans);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}