#include <bits/stdc++.h>
#define Getchar() p1 == p2 and (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++
char buf[1 << 21], *p1, *p2;
int read (void)
{
	int x = 0; char c = Getchar(); bool f = c != '-';
	while (c < '0' or c > '9') if ((c = Getchar()) == '-') f = false;
	while (c >= '0' and c <= '9') x = x * 10 + c - 48, c = Getchar();
	return f ? x : -x;
}
const int maxn = 1 << 19, B = 350;
int n, m, siz[maxn], fa[maxn], ch[maxn][2], rev[maxn]; std::vector<int> e[maxn];
long long a[maxn], tag[maxn]; std::vector<long long> g[maxn];
int get (int x) {return ch[fa[x]][1] == x;}
bool isroot (int x) {return ch[fa[x]][0] != x and ch[fa[x]][1] != x;}
void pushup (int x)
{
	siz[x] = siz[ch[x][0]] + siz[ch[x][1]] + 1;
	std::vector<long long>().swap(g[x]);
	if (siz[x] <= B)
		g[x].insert(g[x].end(), g[ch[x][0]].begin(), g[ch[x][0]].end()),
		g[x].insert(g[x].end(), g[ch[x][1]].begin(), g[ch[x][1]].end()),
		std::inplace_merge(g[x].begin(), g[x].begin() + siz[ch[x][0]], g[x].end()),
		g[x].insert(std::lower_bound(g[x].begin(), g[x].end(), a[x]), a[x]);
}
void upd (int u, long long w)
{
	if (u)
	{
		a[u] += w; tag[u] += w;
		if (siz[u] <= B) for (auto &c: g[u]) c += w;
	}
}
void reverse (int x) {if (x) std::swap(ch[x][0], ch[x][1]), rev[x] ^= 1;}
void pushdown (int x)
{
	if (rev[x]) reverse(ch[x][0]), reverse(ch[x][1]), rev[x] = 0;
	if (tag[x]) upd(ch[x][0], tag[x]), upd(ch[x][1], tag[x]), tag[x] = 0;
}
void rotate (int x)
{
	int y = fa[x], z = fa[y], k = get(x);
	fa[x] = z; if (!isroot(y)) ch[z][get(y)] = x;
	fa[ch[x][k ^ 1]] = y; ch[y][k] = ch[x][k ^ 1];
	fa[y] = x; ch[x][k ^ 1] = y; pushup(y); pushup(x);
}
void splay (int x)
{
	static int st[maxn], tp; st[tp = 1] = x;
	for (int y = x; !isroot(y); y = fa[y]) st[++tp] = fa[y];
	while (tp) pushdown(st[tp--]);
	while (!isroot(x))
	{
		int y = fa[x];
		if (!isroot(y)) rotate(get(x) == get(y) ? y : x);
		rotate(x);
	}
}
void access (int u) {for (int v = 0; u; u = fa[v = u]) splay(u), ch[u][1] = v, pushup(u);}
void makeroot (int u) {access(u); splay(u); reverse(u);}
void split (int u, int v) {makeroot(u); access(v); splay(v);}
void link (int u, int v) {split(u, v); fa[u] = v;}
void cut (int u, int v) {split(u, v); ch[v][0] = fa[u] = 0; siz[v] = 1; g[v] = {a[v]};}
int ask (int u, long long w)
{
	if (siz[u] <= B) return g[u].end() - std::lower_bound(g[u].begin(), g[u].end(), w);
	pushdown(u); return (ch[u][0] ? ask(ch[u][0], w) : 0) + (ch[u][1] ? ask(ch[u][1], w) : 0) + (a[u] >= w);
}
void dfs (int u, int fr)
{
	for (int v: e[u]) if (v != fr) fa[v] = u, dfs(v, u), ch[u][1] = v;
	pushup(u);
}
signed main ()
{
	n = read(); m = read();
	for (int i = 1; i <= n; i++) g[i] = {a[i] = read()}, siz[i] = 1;
	for (int i = 1, u, v; i < n; i++) u = read(), v = read(), e[u].push_back(v), e[v].push_back(u);
	dfs(1, 0);
	for (int ans = 0; m--; )
	{
		int o = read(), u = read() ^ ans, v = o ^ 2 ? read() ^ ans : 0, w = read() ^ ans;
		if (o == 1) a[++n] = w, cut(u, v), link(u, n), link(v, n);
		if (o == 2) a[++n] = w, link(u, n);
		if (o == 3) split(u, v), upd(v, w);
		if (o == 4) split(u, v), printf("%d\n", ans = ask(v, w));
	}
	return 0;
}