[题解]LuoGu2633：Count on a tree

原题传送门
主席树题~~
把区间问题转移到了树上
怎么办呢？

想想主席树的特点
询问[l,r]，采用第r棵树减去第l-1棵树
（前缀和思想）

树上有没有做这种问题的算法呢？
有！树上差分！
只要用u这棵树+v这棵树-lca这棵树-fa[lca]这棵树即可，其余的就是主席树模板了

至于为什么-lca-fa[lca]这个问题。。。树上差分维护点权因为lca也在内，不能把lca也减掉
还有，我的lca是用树剖求得

Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
struct Edge{
	int to, next;
}edge[maxn << 1];
int lc[maxn << 5], rc[maxn << 5], sum[maxn << 5], rt[maxn], size[maxn], son[maxn], d[maxn], fa[maxn];
int num, head[maxn], id[maxn], cnt, top[maxn], sz, a[maxn], b[maxn], p, q, n, m;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void add_edge(int x, int y){ edge[++num].to = y; edge[num].next = head[x]; head[x] = num; }

void dfs(int u){
	size[u] = 1, son[u] = -1;
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u]){
			fa[v] = u, d[v] = d[u] + 1;
			dfs(v);
			size[u] += size[v];
			if (son[u] == -1 || son[u] != -1 && size[son[u]] < size[v]) son[u] = v;
		}
	}
}

void dfs(int u, int x){
	id[u] = ++cnt, top[u] = x;
	if (son[u] == -1) return;
	dfs(son[u], x);
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u] && v != son[u]) dfs(v, v);
	}
}

void build(int &rt, int l, int r){
	rt = ++sz; sum[rt] = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(lc[rt], l, mid); build(rc[rt], mid + 1, r);
}

int update(int o, int l, int r){
	int oo = ++sz;
	lc[oo] = lc[o], rc[oo] = rc[o], sum[oo] = sum[o] + 1;
	if (l == r) return oo;
	int mid = (l + r) >> 1;
	if (mid >= p) lc[oo] = update(lc[o], l, mid); else rc[oo] = update(rc[o], mid + 1, r);
	return oo;
}

int query(int u, int v, int lca, int flca, int l, int r, int k){
	int mid = (l + r) >> 1, x = sum[lc[u]] + sum[lc[v]] - sum[lc[lca]] - sum[lc[flca]];
	if (l == r) return l;
	if (k <= x) return query(lc[u], lc[v], lc[lca], lc[flca], l, mid, k); else return query(rc[u], rc[v], rc[lca], rc[flca], mid + 1, r, k - x);
}

void dfs1(int u){
	p = lower_bound(b + 1, b + 1 + q, a[u]) - b;
	rt[u] = update(rt[fa[u]], 1, q);
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u]) dfs1(v);
	}
}

int lca(int u, int v){
	while (top[u] != top[v]){
		if (d[top[u]] < d[top[v]]) swap(u, v);
		u = fa[top[u]];
	}
	return d[u] < d[v] ? u : v;
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i) a[i] = read(), b[i] = a[i];
	for (int i = 1; i < n; ++i){
		int x = read(), y = read();
		add_edge(x, y); add_edge(y, x);
	}
	dfs(1); dfs(1, 1);
	sort(b + 1, b + 1 + n);
	q = unique(b + 1, b + 1 + n) - b - 1;
	build(rt[0], 1, q);
	dfs1(1);
	int ans = 0;
	while (m--){
		int u = read(), v = read(), k = read(); u ^= ans;
		int Lca = lca(u, v);
		printf("%d\n", ans = b[query(rt[u], rt[v], rt[Lca], rt[fa[Lca]], 1, q, k)]);
	}
	return 0;
}