#include<bits/stdc++.h>
using namespace std;
#define calc(x,y) (a[x]>a[y]?x:y)
int n,m,x,y,k,tot,lg[1000001],son[1000001],dfn[1000001],fa[1000001],top[1000001],siz[1000001],dep[1000001],rnk[1000001];
long long lst,a[1000001],st[1000001][21];
vector <int> G[1000001];
long long ask(int l,int r){
	int k=lg[r-l+1];
	return calc(st[l][k],st[r-(1<<k)+1][k]);
}
struct node{
	int l,r;
	node(int l=0,int r=0):l(l),r(r){}
	long long v()const{return a[ask(l,r)];}
	bool operator<(const node k)const{return node(l,r).v()<k.v();}
};
priority_queue <node> p;
priority_queue <long long> q,w;
void dfs1(int x,int u){
	siz[x]=1,dep[x]=dep[u]+1,fa[x]=u;
	for(auto y:G[x]) if(y!=u) dfs1(y,x),siz[x]+=siz[y],siz[y]>siz[son[x]]&&(son[x]=y);
}
void dfs2(int x,int t){
	top[x]=t,dfn[x]=++tot,rnk[tot]=x;
	if(son[x]) dfs2(son[x],t);
	for(auto y:G[x]) if(y!=fa[x]&&y!=son[x]) dfs2(y,y);
}
int main(){
	scanf("%d",&n);
	for(int i=2;i<=n;i++) lg[i]=lg[i/2]+1;
	for(int i=2;i<=n;i++){
		scanf("%d%d",&x,&y);
		G[x].push_back(y);
		G[y].push_back(x);
	}
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	dfs1(1,0),dfs2(1,1);
	for(int i=1;i<=n;i++) st[i][0]=rnk[i];
	for(int k=1;k<=lg[n];k++) for(int i=1;i+(1<<k)-1<=n;i++) st[i][k]=calc(st[i][k-1],st[i+(1<<k-1)][k-1]);
	scanf("%d",&m);
	while(m--){
		scanf("%d%d%d",&x,&y,&k),x=(x^lst)%n+1,y=(y^lst)%n+1,lst=0;
		while(p.size()) p.pop();
		while(q.size()) q.pop();
		while(top[x]!=top[y]){
			if(dep[top[x]]<dep[top[y]]) swap(x,y);
			p.push(node(dfn[top[x]],dfn[x]));
			x=fa[top[x]];
		}
		p.push(node(min(dfn[x],dfn[y]),max(dfn[x],dfn[y])));
		for(int i=61,c=0;i>=0;i--,c=0){
			while(p.size()&&c<k&&(p.top().v()>>i&1)){
				int l=p.top().l,r=p.top().r,x=ask(l,r);
				p.pop(),q.push(a[x]),c++;
				if(l!=dfn[x]) p.push(node(l,dfn[x]-1));
				if(r!=dfn[x]) p.push(node(dfn[x]+1,r));
			}
			while(q.size()&&(q.top()>>i&1)) w.push(q.top()),q.pop();
			if(w.size()>=k){
				lst^=1ll<<i,swap(q,w);
				while(w.size()) w.pop();
			}
			else while(w.size()) q.push(w.top()^(1ll<<i)),w.pop();
		}
		printf("%lld\n",lst);
	}
	return 0;
}