#include<bits/extc++.h>
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
//本代码含有小众情感元素，建议满 18 周岁后观看
#ifdef __unix__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#else
#define getchar _getchar_nolock
#define putchar _putchar_nolock
#endif
#define debug fprintf(stderr,"Tomoyo after ~It's a wonderful life!~\n")
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define Inf (int)INFINITY
#define inf 0x3f3f3f3f
#define int long long
#define pb push_back
#define ll long long
#define endl '\n'
#define y second
#define x first
using namespace std;
const int N=1e6+10,T=200;
void read(){};
template<class T1,class ...T2>
inline void read(T1& ret,T2&... rest){
	ret=0;char c=getchar();bool f=false;
	while(c<'0'||c>'9')f=c=='-',c=getchar();
	while(c>='0'&&c<='9')ret=ret*10+c-'0',c=getchar();
	f&&(ret=-ret),read(rest...);
}
#define cin(...) read(__VA_ARGS__)
template<class T>
inline void print(T x){
	static int s[35],t=0;
	bool f=x<0;if(f)x=-x;
	do s[t++]=x%10,x/=10;while(x);
	f&&putchar('-');while(t)putchar(s[--t]+'0');
}
vector<int>nxt[N];
int n,q,cnt,a[N],tmp[N],dep[N],dfn[N],top[N],fa[N],hvy[N],sz[N];
void dfs1(int u){sz[u]=1;for(int v:nxt[u])if(v^fa[u])dep[v]=dep[fa[v]=u]+1,dfs1(v),sz[u]+=sz[v],(sz[v]>sz[hvy[u]]&&(hvy[u]=v));}
void dfs2(int u,int tp){top[u]=tp,dfn[u]=++cnt,(hvy[u]&&(dfs2(hvy[u],tp),1));for(int v:nxt[u])if(v!=fa[u]&&v!=hvy[u])dfs2(v,v);}
template<int N>
struct ST{
#define k lg[r-l+1]
	int st[N][__lg(N)+1],idx[N][__lg(N)+1],lg[N];
	void init(int*a,int n){
		lg[0]=-1;
		for(int i=1;i<=n;i++)lg[i]=lg[i/2]+1;
		for(int i=1;i<=n;i++)st[i][0]=a[idx[i][0]=i];
		for(int j=1;j<=lg[n];j++)
			for(int i=1;i+(1<<j)-1<=n;i++){
				st[i][j]=max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
				idx[i][j]=(st[i][j]==st[i][j-1]?idx[i][j-1]:idx[i+(1<<(j-1))][j-1]);
			}
	}
	int ask(int l,int r){return max(st[l][k],st[r-(1<<k)+1][k]);}
	int askid(int l,int r){return st[l][k]>st[r-(1<<k)+1][k]?idx[l][k]:idx[r-(1<<k)+1][k];}
#undef k
};ST<N>st;
struct Node{int l,r,i;bool operator<(const Node&n)const{return tmp[i]<tmp[n.i];}};
signed main(){
	cin(n);for(int i=1,u,v;i<n;i++)cin(u,v),nxt[u].pb(v),nxt[v].pb(u);
	dfs1(1),dfs2(1,1);for(int i=1;i<=n;i++)cin(a[i]),tmp[dfn[i]]=a[i];
	st.init(tmp,n),cin(q);
	for(int u,v,m,res=0;q;q--){
		cin(u,v,m),u=(u^res)%n+1,v=(v^res)%n+1,res=0;
		priority_queue<Node>pq;vector<int>val,t;
		for(;top[u]^top[v];u=fa[top[u]]){
			if(dep[top[u]]<dep[top[v]])swap(u,v);
			pq.push({dfn[top[u]],dfn[u],st.askid(dfn[top[u]],dfn[u])});
		}
		if(dep[u]<dep[v])swap(u,v);
		pq.push({dfn[v],dfn[u],st.askid(dfn[v],dfn[u])});
		for(Node p;!pq.empty()&&(int)val.size()<T;){
			val.pb(tmp[(p=pq.top()).i]),pq.pop();
			if(p.l<p.i)pq.push({p.l,p.i-1,st.askid(p.l,p.i-1)});
			if(p.i<p.r)pq.push({p.i+1,p.r,st.askid(p.i+1,p.r)});
		}
//		for(int v:val)cerr<<v<<" ";
//		cerr<<endl;
		if((int)val.size()<m){puts("0");continue;}
		for(int i=61;~i;i--,t.clear()){
			for(int v:val)if((v>>i)&1)t.pb(v);else break;
			if((int)t.size()>=m)res|=(1<<i),val=t;
			for(int&v:val)if((v>>i)&1)v-=(1<<i);
			sort(all(val),greater<int>());
		}
		print(res),putchar(endl);
	}
	return 0;
}