#include <bits/stdc++.h>
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
using namespace std;
typedef long long i64;
const int maxn = 1000000;
vector<int> g[maxn + 5];
i64 a[maxn + 5];
int dep[maxn + 5];
int siz[maxn + 5];
int son[maxn + 5];
int f[maxn + 5];
void dfs1(int u, int fa) {
	f[u] = fa;
	dep[u] = dep[fa] + 1;
	siz[u] = 1;
	for (int v : g[u]) {
		if (v == fa) continue;
		dfs1(v, u);
		siz[u] += siz[v];
		if (siz[v] > siz[son[u]]) son[u] = v;
	}
}
int tp[maxn + 5];
int id[maxn + 5], rnk[maxn + 5], stamp;
void dfs2(int u, int fa, int t) {
	tp[u] = t;
	rnk[id[u] = ++stamp] = u;
	if (son[u]) dfs2(son[u], u, t);
	for (int v : g[u])
		if (v != fa && v != son[u]) dfs2(v, u, v);
}
pair<i64, int> mx[maxn + 5][20];
int lg2[maxn + 5];
inline int queryMx(int l, int r) {
	int t = lg2[r - l + 1];
	return max(mx[l][t], mx[r - (1 << t) + 1][t]).se;
}
struct seg {
	int l, r, id;
	bool operator<(const seg& b) const { return a[rnk[id]] > a[rnk[b.id]]; }
};
set<seg> s;
inline void ins(int l, int r) { s.insert({l, r, queryMx(l, r)}); }
void init(int x, int y) {
	while (tp[x] != tp[y]) {
		if (dep[tp[x]] < dep[tp[y]]) swap(x, y);
		ins(id[tp[x]], id[x]);
		x = f[tp[x]];
	}
	if (dep[x] < dep[y]) swap(x, y);
	ins(id[y], id[x]);
}
i64 pop() {
	if (s.empty()) return 0;
	seg nw = *s.begin();
	s.erase(nw);
	if (nw.l < nw.id) ins(nw.l, nw.id - 1);
	if (nw.id < nw.r) ins(nw.id + 1, nw.r);
	return a[rnk[nw.id]];
}
inline bool get(i64 v, int w) { return (v >> w) & 1; }
int main() {
	int n, q;
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		g[u].PB(v), g[v].PB(u);
	}
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
	dfs1(1, 0), dfs2(1, 0, 1);
	for (int i = 2; i <= n; i++) lg2[i] = lg2[i >> 1] + 1;
	for (int i = n; i; i--) {
		mx[i][0] = {a[rnk[i]], i};
		for (int j = 1; i + (1 << j) - 1 <= n; j++) mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
	}
	scanf("%d", &q);
	i64 ans = 0;
	for (int i = 1; i <= q; i++) {
		int x, y, m;
		scanf("%d%d%d", &x, &y, &m);
		x = (x ^ ans) % n + 1, y = (y ^ ans) % n + 1;
		init(x, y);
		vector<i64> L;
		ans = 0;
		for (int j = 61; ~j; j--) {
			int c = 0;
			for (i64 o : L) c += get(o, j);
			while (c < m) {
				i64 o = pop();
				if ((o & ans) != ans) break;
				L.PB(o);
				if (get(o, j)) c++;
				else break;
			}
			if (c >= m) {
				vector<i64> nL; 
				for (i64 o : L)
					if (get(o, j)) nL.PB(o);
				L.swap(nL);
				ans |= 1LL << j;
			}
		}
		printf("%lld\n", ans);
		s.clear();
	}
}