#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const ll N=1000001,M=31;
ll n,m,tot,e[N];
ll b[N];
vector<ll> a[N];
namespace ST
{
    ll lg[N];
    ll a[N][M];
    ll max(ll x,ll y)
    {
        return b[x]>b[y]?x:y;
    }
    void init()
    {
        for(ll i=1;i<=n;++i) a[i][0]=e[i];
        for(ll i=0;i<=20;++i)
        {
            for(ll j=(1<<i);j<=min(1ll<<(i+1)-1,n);++j) lg[j]=i;
        }
        for(ll i=1;i<=20;++i)
        {
            for(ll j=1;j<=n;++j)
            {
                if(j+(1<<i)-1<=n) a[j][i]=max(a[j][i-1],a[j+(1<<(i-1))][i-1]);
            }
        }
    }
    ll sum(ll x,ll y)
    {
        if(x>y) swap(x,y);
        return max(a[x][lg[y-x]],a[y-(1<<lg[y-x])+1][lg[y-x]]);
    }
}
struct tree
{
    ll f,s,d,t,z,b;
}T[N];
struct str
{
    ll x,y,t;
    str() {}
    str(ll x,ll y):x(x),y(y),t(ST::sum(T[x].b,T[y].b)) {}
    friend bool operator<(str x,str y)
    {
        return b[x.t]<b[y.t];
    }
};
priority_queue<str> Q1;
priority_queue<ll> Q2;
void dfs1(ll x)
{
    T[x].s=1;
    T[x].d=T[T[x].f].d+1;
    for(auto i:a[x])
    {
        if(i==T[x].f) continue;
        T[i].f=x;
        dfs1(i);
        T[x].s+=T[i].s;
        if(T[i].s>T[T[x].z].s) T[x].z=i;
    }
}
void dfs2(ll x,ll t)
{
    T[x].b=++tot;
    T[x].t=t;
    if(T[x].z) dfs2(T[x].z,t);
    for(auto i:a[x])
    {
        if(i==T[x].f||i==T[x].z) continue;
        dfs2(i,i);
    }
}
void solve(ll x,ll y)
{
    while(T[x].t!=T[y].t)
    {
        if(T[T[x].t].d>T[T[y].t].d)
        {
            Q1.push(str(T[x].t,x));
            x=T[T[x].t].f;
        }
        else
        {
            Q1.push(str(T[y].t,y));
            y=T[T[y].t].f;
        }
    }
    Q1.push(str(x,y));
}
int main()
{
    scanf("%lld",&n);
    for(ll i=1;i<=n-1;++i)
    {
        ll x,y;
        scanf("%lld%lld",&x,&y);
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(ll i=1;i<=n;++i)
    {
        scanf("%lld",&b[i]);
    }
    dfs1(1);
    dfs2(1,1);
    for(ll i=1;i<=n;++i) e[T[i].b]=i;
    ST::init();
    scanf("%lld",&m);
    ll las=0;
    for(ll i=1;i<=m;++i)
    {
        ll x,y,k;
        scanf("%lld%lld%lld",&x,&y,&k);
        x=(x^las)%n+1,y=(y^las)%n+1;
        while(!Q1.empty()) Q1.pop();
        while(!Q2.empty()) Q2.pop();
        solve(x,y);
        while(!Q1.empty()&&Q2.size()<k*62)
        {
            auto [x,y,t]=Q1.top();
            Q2.push(b[t]);
            Q1.pop();
            if(T[x].d>T[y].d) swap(x,y);
            if(T[x].d<T[t].d) Q1.push(str(x,T[t].f));
            if(T[t].d<T[y].d) Q1.push(str(T[t].z,y));
        }
        while(Q2.size()<k) Q2.push(0);
        ll s=0;
        for(ll i=62;i>=0;--i)
        {
            static ll z[11];
            for(ll j=1;j<=k;++j) z[j]=Q2.top(),Q2.pop();
            if((z[k]&(1ll<<i))!=0)
            {
                s|=(1ll<<i);
                for(ll j=1;j<=k;++j) Q2.push(z[j]);
            }
            else
            {
                for(ll j=1;j<=k;++j) Q2.push(z[j]&(~(1ll<<i)));
            }
        }
        printf("%lld\n",las=s);
    }
    return 0;
}