#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1e6+10,MAXM = 1000;
int n,q;
ll a[MAXN];
vector<int>e[MAXN];

int dfn[MAXN],ord[MAXN],sz[MAXN],son[MAXN],dep[MAXN],top[MAXN],fa[MAXN],dtot;

int now;

void dfs1(int u){
    sz[u] = 1;
    for(auto v : e[u])if(v ^ fa[u]){
        dep[v] = dep[u]+1;
        fa[v] = u;
        dfs1(v);
        if(sz[son[u]] < sz[v])son[u] = v;
        sz[u] += sz[v];
    }
}
void dfs2(int u,int node){
    top[u] = node,dfn[u] = ++dtot,ord[dtot] = u;
    if(son[u])dfs2(son[u],node);
    for(auto v : e[u])if(v != fa[u] && v != son[u])dfs2(v,v);
}

namespace _{ //O(1) 区间min
    int st[20][MAXN];
    int cmp(int x,int y){return (a[x] > a[y]) ? (x) : (y);}
    void solve(){
        rep(i,1,n)st[0][i] = ord[i];

        rep(j,1,19)rep(i,1,n-(1<<j)+1)st[j][i] = cmp(st[j-1][i],st[j-1][i+(1<<(j-1))]);
    }
    int query(int x,int y){
        int len = __lg(y-x+1);
        return cmp(st[len][x],st[len][y-(1<<len)+1]);
    }
};
using _::query;

ll lst;

int pL[MAXN],pR[MAXN];

typedef array<ll,2> pr; //(val,id)

priority_queue<pr> pq;
ll b[MAXM],tot;

void push(int L,int R,int t=0){
    int id = query(L,R);
    pL[dfn[id]] = L,pR[dfn[id]] = R;
    if(!t)pq.push({a[id],id});    
}

mt19937 rnd(time(NULL));

void solve(int x,int y,int m){
    while(pq.size())pq.pop(); tot = 0;
    int cnt = (m-1) * 63;

    while(top[x] != top[y]){
        if(dep[top[x]] < dep[top[y]])swap(x,y);
        push(dfn[top[x]],dfn[x]);
        x = fa[top[x]];
        now++;
    }
    if(dep[x] > dep[y])swap(x,y);
    push(dfn[x],dfn[y]);

    
    while(pq.size() && cnt--){
        pr now = pq.top(); pq.pop();
        b[++tot] = now[0];
        int p = dfn[now[1]],u = pL[p],v = pR[p];

        if(p != u)push(u,p-1);
        if(p != v)push(p+1,v);
    }   
    lst = 0;
    
    if(tot >= m){
        per(i,61,0){
            lst ^= (1LL<<i);
            int cnt = 0;
            rep(j,1,tot)cnt += (b[j] & lst) == lst;
            if(cnt < m){
                lst ^= (1LL<<i);
            }
        }
    }
    
    cout<<lst<<"\n";
}       

int main(){
    //freopen("query.in","r",stdin);
    //freopen("query.out","w",stdout);

    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n;
    rep(i,1,n-1){
        int u,v; cin>>u>>v;
        e[u].push_back(v); e[v].push_back(u);
    }
    rep(i,1,n)cin>>a[i];

    dfs1(1);
    dfs2(1,1);

    _::solve();

    cin>>q;
    rep(i,1,q){
        ll x,y,m; cin>>x>>y>>m;
        x = (x^lst)%n+1;
        y = (y^lst)%n+1;
        solve(x,y,m);
    }

    cout<<"now : "<<now<<"\n";
    return 0;
}