#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
 void read(int &x){
	 x=0;char ch=getchar();
	 while(ch<'0'||ch>'9')ch=getchar();
	 while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch-'0');ch=getchar();}
 }
//void read(ll &x){
//	x=0;char ch=getchar();
//	while(ch<'0'||ch>'9')ch=getchar();
//	while(ch>='0'&&ch<='9'){x=(x<<1ll)+(x<<3ll)+(ch-'0');ch=getchar();}
//}
const int N=1e6+10,Q=1e5+10;
int n,m,q;ll a[N];
vector<int>E[N];
int siz[N],top[N],dep[N],father[N],son[N],id[N],rez[N],tot;
void dfs_sp1(int u,int fa){
	father[u]=fa;dep[u]=dep[fa]+1;siz[u]=1;
	for(int v:E[u]){
		if(v==fa)continue;
		dfs_sp1(v,u);
		siz[u]+=siz[v];
		if(siz[v]>siz[son[u]])son[u]=v;
	}
}
void dfs_sp2(int u){
	if(son[u]){
		int v=son[u];
		top[v]=top[u];
		id[v]=++tot;rez[id[v]]=v;
		dfs_sp2(v);
	}
	for(int v:E[u]){
		if(id[v])continue;
		top[v]=v;
		id[v]=++tot;rez[id[v]]=v;
		dfs_sp2(v);
	}
}
namespace ST{
	int st[N][20],Log[N];
	void init(){
		for(int i=1;i<=n;i++)st[i][0]=i;
		Log[1]=0;for(int i=2;i<=n;i++)Log[i]=Log[i/2]+1;
		for(int j=1;j<20;j++){
			for(int i=1;i+(1<<j)-1<=n;i++){
				st[i][j]=(a[rez[st[i][j-1]]]>a[rez[st[i+(1<<(j-1))][j-1]]])?st[i][j-1]:st[i+(1<<(j-1))][j-1];
			}
		}
	}
	int ask(int l,int r){
		int lg=Log[r-l+1];
		return (a[rez[st[l][lg]]]>a[rez[st[r-(1<<lg)+1][lg]]])?st[l][lg]:st[r-(1<<lg)+1][lg];
	}
}
set<pair<int,int> >now;
int lca(int x,int y){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		x=father[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	return x;
}
void cx(int x,int y){
	now.clear();
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		now.insert(make_pair(id[top[x]],id[x]));
		x=father[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	now.insert(make_pair(id[x],id[y]));
}
int Get(){
//	if(now.empty())cout<<"A";
//	cout<<"now:";
//	for(auto i=now.begin();i!=now.end();i++){
//		cout<<(*i).first<<" "<<(*i).second<<"   ";
//	}
//	cout<<endl;
	int mx=ST::ask((*now.begin()).first,(*now.begin()).second);
	set<pair<int,int> >::iterator is=now.begin();
	for(auto i=now.begin();i!=now.end();i++){
		int x=ST::ask((*i).first,(*i).second);
		mx=(a[rez[mx]]>a[rez[x]])?mx:x;is=(mx==x)?i:is;
	}
	pair<int,int>p1={(*is).first,mx-1},p2={mx+1,(*is).second};
	now.erase(is);
	if(p1.first<=p1.second)now.insert(p1);
	if(p2.first<=p2.second)now.insert(p2);
	return a[rez[mx]];
}
vector<int>ve;
int get_sum(int lg){
	int s=0ll;for(int v:ve)s+=(v>>lg)&1ll;
	return s;
}
#undef int 
int main(){
#define int long long
	read(n);
	for(int i=1;i<n;i++){
		int x,y;read(x);read(y);
		E[x].push_back(y);E[y].push_back(x);
	}
	for(int i=1;i<=n;i++)read(a[i]);
	read(q);
	dfs_sp1(1,0);top[1]=1;id[1]=rez[1]=++tot;dfs_sp2(1);
//	cout<<"siz:";for(int i=1;i<=n;i++)cout<<siz[i]<<" ";cout<<endl;
//	cout<<"son:";for(int i=1;i<=n;i++)cout<<son[i]<<" ";cout<<endl;
//	cout<<"dep:";for(int i=1;i<=n;i++)cout<<dep[i]<<" ";cout<<endl;
//	cout<<"father:";for(int i=1;i<=n;i++)cout<<father[i]<<" ";cout<<endl;
//	cout<<"id:";for(int i=1;i<=n;i++)cout<<id[i]<<" ";cout<<endl;
//	cout<<"rez:";for(int i=1;i<=n;i++)cout<<rez[i]<<" ";cout<<endl;
	ST::init();
	ll lastans=0;
	for(int i=1;i<=q;i++){
		ll x,y;read(x);read(y);read(m);
		x=((x^lastans)%n)+1,y=((y^lastans)%n)+1;
		cx(x,y);
		ve.clear();ve.shrink_to_fit();
		int lg=61;ll ans=0;int sum=0;
//		cout<<x<<" "<<y<<" "<<m<<endl;
//		cout<<dep[x]+dep[y]-2*dep[lca(x,y)]+1<<endl;
		// for(int j=1;~lg&&j<=min(200,m<<6);j++){
		for(int j=1;~lg&&j<=min({200ll,m<<6,dep[x]+dep[y]-2*dep[lca(x,y)]+1});j++){
			ll x=Get();
//			cout<<x<<"  "<<lg<<" "<<(x<(1ll<<lg))<<"  "<<(1ll<<lg)<<endl;
			while(lg>=0ll&&x<(1ll<<lg)){
				ans+=(1ll<<lg)*(sum>=m);
//				cout<<"$ "<<lg<<" "<<sum<<endl;
//				if(sum>=m){
//					cout<<"! "<<lg<<" "<<sum<<" ";
//					sum=get_sum(lg);
//					cout<<sum<<" !\n";
//				}
				lg--;sum=get_sum(lg);
			}
			ve.push_back(x);
//			cout<<"@\n";
			sum+=(x>>lg)&1;
		}
		while(~lg){
			ans+=(1ll<<lg)*(sum>=m);
			lg--;sum=get_sum(lg);
		}
//		cout<<get_sum(4)<<"  "<<lg<<endl;
//		cout<<endl;
		lastans=ans;
		printf("%lld\n",ans);
	}
	return 0;
}