WA & 0pts

#include <bits/stdc++.h>
#define ls pos << 1
#define rs pos << 1 | 1
using namespace std;
namespace country {
	const int maxn = 1e5 + 5;
	const int inf = 2147483647;
	int n, m;
	int tot, to[maxn << 1], nxt[maxn << 1];
	int head[maxn], a[maxn];
	int siz[maxn], dep[maxn], fa[maxn], son[maxn], top[maxn], id[maxn], cnt, w[maxn];
	int tree[maxn << 2], lazy[maxn << 2];
	int now, tmp;

	void addedge(int x, int y) {
	    to[++tot] = y;
	    nxt[tot] = head[x];
	    head[x] = tot;
	}

	void dfs1(int x, int y) {
		dep[x] = dep[y] + 1;
		fa[x] = y, siz[x] = 1;
		for (int i = head[x]; i; i = nxt[i]) {
			int t = to[i];
			if (t == y) continue;
			dfs1(t, x);
			siz[x] += siz[t];
			if (!son[x] || siz[t] > siz[son[x]]) son[x] = t;
		}
	}

	void dfs2(int x, int y) {
		top[x] = y, id[x] = ++cnt, w[cnt] = a[x];
		if (!son[x]) return ;
		dfs2(son[x], y);
		for (int i = head[x]; i; i = nxt[i]) {
			int t = to[i];
			if (t == fa[x] || t == son[x]) continue;
			dfs2(t, t);
		}
	}

	void build(int pos, int l, int r) {
		int mid = (l + r) >> 1;
		if (l == r) {
			tree[pos] = w[l];
			return ;
		}
		build(ls, l, mid);
		build(rs, mid + 1, r);
		tree[pos] = min(tree[ls], tree[rs]);
	}

	void mark(int pos, int k, int l, int r) {
		tree[pos] = k, lazy[pos] = k;
	}

	void pushdown(int pos, int l, int r) {
		int mid = (l + r) >> 1;
		mark(ls, lazy[pos], l, mid), mark(rs, lazy[pos], mid + 1, r);
		lazy[pos] = 0;
	}

	void update1(int pos, int l, int r, int x, int y, int val) {
		int mid = (l + r) >> 1;
		if (x <= l && r <= y) {
			mark(pos, val, l, r);
			return ;
		}
		if (lazy[pos]) pushdown(pos, l, r);
		if (x <= mid) update1(ls, l, mid, x, y, val);
		if (y > mid) update1(rs, mid + 1, r, x, y, val);
		tree[pos] = min(tree[ls], tree[rs]);
	}

	void update2(int x, int y, int val) {
		while (top[x] != top[y]) {
			if (dep[top[x]] < dep[top[y]]) swap(x, y);
			update1(1, 1, n, id[top[x]], id[x], val);
			x = fa[top[x]];
		}
		if (dep[x] < dep[y]) swap(x, y);
		update1(1, 1, n, id[y], id[x], val);
	}

	int search(int x, int y) {
		while (top[x] != top[y]) {
			if (dep[top[x]] < dep[top[y]]) swap(x,y);
			if (fa[top[x]] == y) return top[x];
			x = fa[top[x]];
		}
		if (dep[x] > dep[y]) swap(x,y);
		return son[x];
	}

	int query(int pos, int l, int r, int x, int y) {
		int ret = inf, mid = (l + r) >> 1;
		if (x <= l && r <= y) return tree[pos];
		if (lazy[pos]) pushdown(pos, l, r);
		if (x <= mid) ret = min(ret, query(ls, l, mid, x, y));
		if (y > mid) ret = min(ret, query(rs, mid + 1, r, x, y));
		return ret;
	}

	void solve() {
		ios::sync_with_stdio(false);
		cin.tie(NULL), cout.tie(NULL);
		cin >> n >> m;
		for (int i = 1; i < n; i++) {
			int x, y;
			cin >> x >> y;
			addedge(x, y), addedge(y, x);
		}
		for (int i = 1; i <= n; i++) cin >> a[i];
		dfs1(1, 0), dfs2(1, 1), build(1, 1, n);
		cin >> now;
		while (m--) {   
			int opt, idx, x, y, v;
			cin >> opt;
			if (opt == 1) {
				cin >> idx;
				now = idx;
			} else if (opt == 2) {
				cin >> x >> y >> v;
				update2(x, y, v);
			} else {
				cin >> idx;
				if (idx == now) cout << tree[1] << '\n';
				else if (dep[idx] < dep[now] && fa[tmp = search(idx, now)] == idx) {
					int a, b;
					a = query(1, 1, n, 1, id[tmp] - 1);
					b = query(1, 1, n, id[tmp] + siz[tmp], n);
					cout << min(a, b) << '\n';
				} else cout << query(1, 1, n, id[idx], id[idx] + siz[idx] - 1);
			}
		}
	}
}

int main() {
	country::solve();
    return 0;
}