#include<bits/stdc++.h>
using namespace std;
namespace file_read{
    namespace input_file_io{
        char ib[1<<25],*ip1=ib,*ip2=ib;
        inline char gc(){
#ifndef ONLINE_JUDGE
			return getchar();
#else
            return (ip1==ip2&&(ip2=(ip1=ib)+fread(ib,1,1<<24,stdin)),ip1==ip2?EOF:*ip1++);
#endif
        }
        inline int read(){
            int x=0;
            char c=gc();
            while(c<'0'||c>'9')c=gc();
            while(c>='0'&&c<='9'){
                x=(x<<3)+(x<<1)+(c^'0');
                c=gc();
            }
            return x;
        }
        inline long long readl(){
            long long x=0;
            char c=gc();
            while(c<'0'||c>'9')c=gc();
            while(c>='0'&&c<='9'){
                x=(x<<3)+(x<<1)+(c^'0');
                c=gc();
            }
            return x;
        }
    };
    namespace output_file_io{
        char ob[1<<25],*op=ob;
        inline void pc(char c){
            *op++=c;
        }
        void write(long long x){
            if(x<0){
                pc('-');
                x=-x;
            }
            if(x==0)pc('0');
            static int number_stack[40];
            int total_count=0;
            while(x)number_stack[++total_count]=x%10,x/=10;
            while(total_count){
                pc(number_stack[total_count]+'0');
                --total_count;
            }
        }
        inline void final_write(){
            fwrite(ob,op-ob,1,stdout);
    	}
    };
	using namespace input_file_io;
	using namespace output_file_io;
};
using namespace file_read;
vector<int>g[1000005];
long long v[1000005];
int fa[1000005],dep[1000005],sz[1000005];
int ffa[1000005],bg[1000005],tot=0;
void dfs1(int x,int la){
	sz[x]=1;
	for(auto cu:g[x]){
		if(cu==la)continue;
		dep[cu]=dep[x]+1;
		fa[cu]=x;
		dfs1(cu,x);
		sz[x]+=sz[cu];
	}
}
void dfs2(int x,int la){
	bg[x]=++tot;
	if(sz[x]==1)return;
	int ans=0,w=0;
	for(auto cu:g[x]){
		if(cu==la)continue;
		if(ans<sz[cu])ans=sz[cu],w=cu;
	}
	ffa[w]=ffa[x];dfs2(w,x);
	for(auto cu:g[x]){
		if(cu==la||cu==w)continue;
		ffa[cu]=cu;dfs2(cu,x);
	}
}
long long vv[21][1000005];
int wz[21][1000005],lg[1000005];
struct apple{
	int l,r,wz;
	long long zz;
	bool operator<(const apple &other)const{
		return zz<other.zz;
	}
};
priority_queue<apple>pq;
void jiaq(int l,int r){
	if(l>r)return;
	int cd=lg[r-l+1];
	apple ap;ap.l=l,ap.r=r;
	if(vv[cd][l]>vv[cd][r-(1<<cd)+1])ap.wz=wz[cd][l],ap.zz=vv[cd][l];
	else ap.wz=wz[cd][r-(1<<cd)+1],ap.zz=vv[cd][r-(1<<cd)+1];
	pq.emplace(ap);
}
int main(){
	int n=read();
	for(int i=1;i<n;++i){
		int u=read(),v=read();
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	for(int i=1;i<=n;++i)v[i]=readl();
	dfs1(1,0);ffa[1]=1;dfs2(1,0);
	for(int i=1;i<=n;++i)vv[0][bg[i]]=v[i],wz[0][bg[i]]=bg[i];
	for(int i=1;i<=19;++i)for(int j=1;j<=n-(1<<i)+1;++j){
		if(vv[i-1][j]>vv[i-1][j+(1<<(i-1))])vv[i][j]=vv[i-1][j],wz[i][j]=wz[i-1][j];
		else vv[i][j]=vv[i-1][j+(1<<(i-1))],wz[i][j]=wz[i-1][j+(1<<(i-1))];
	}
	lg[1]=0;
	for(int i=2;i<=n;++i)lg[i]=lg[i>>1]+1;
	int q=read();
	long long lastans=0;
	while(q--){
		long long xx=readl(),yy=readl();
		int k=read();
		int x=(xx^lastans)%n+1,y=(yy^lastans)%n+1;
		int gs=0;
		while(pq.size())pq.pop();
		while(ffa[x]!=ffa[y]){
			if(dep[ffa[x]]<dep[ffa[y]])swap(x,y);
			jiaq(bg[ffa[x]],bg[x]);gs+=bg[x]-bg[ffa[x]]+1;
			x=fa[ffa[x]];
		}
		if(dep[x]<dep[y])swap(x,y);
		jiaq(bg[y],bg[x]);gs+=bg[x]-bg[y]+1;
		if(gs<k){
			printf("%lld\n",lastans=0);
			continue;
		}
		int kk=min(gs,62*k-61);
		priority_queue<long long>vc;
		while(kk--){
			auto au=pq.top();pq.pop();
			vc.emplace(au.zz);
			jiaq(au.l,au.wz-1);jiaq(au.wz+1,au.r);
		}
		lastans=0;
		for(int i=61;i>=0;--i){
			int gg=0;
			vector<long long>cv;
			while(vc.size()&&(vc.top()&lastans)==lastans){
				if(!((vc.top()>>i)&1))break;
				++gg;
				cv.emplace_back(vc.top());
				vc.pop();
				if(gg>=k)break;
			}
			if(gg>=k){
				lastans|=1ll<<i;
				for(auto cu:cv)vc.emplace(cu);
			}else{
				for(auto cu:cv)vc.emplace(cu^(1ll<<i));
			}
		}
		write(lastans),pc('\n');
	}
	final_write();
	return 0;
}