#include <atcoder/all>
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

int op(int a, int b) {
	return a^b;
}

int e() {
	return (int)(0);
}




Graph G;
vll E;
vll Af;
vll DD;
vector<bool> seen;
ll k = 0;
void dfs(int v) {
	DD.push_back(v);
	E[v] = k;
	k++;
	seen[v] = true; // v を訪問済にする

	// v から行ける各頂点 next_v について
	
	for (auto next_v : G[v]) {
		if (seen[next_v]) continue; // next_v が探索済だったらスルー
		
		dfs(next_v); // 再帰的に探索
	}
	Af[v] = k;
}
int main() {

	ll N, Q;
	cin >> N >> Q;
	vll CC(N);
	rep(i, N) {
		cin >> CC[i];
	}
	G.assign(N, {});
	seen.assign(N, false);
	E.assign(N, 0);
	Af.assign(N, 0);
	rep(i, N - 1) {
		ll A, B;
		cin >> A >> B;
		A--; B--;
		G[A].push_back(B);
		G[B].push_back(A);
	}
	dfs(0);
	segtree<int, op, e>seg(N);
	rep(i, N) {
		seg.set(E[i], CC[i]);
	}
	rep(i, N) {
		//cout << E[i] << endl;
	}
	rep(q, Q) {
		ll T, X, Y;
		cin >> T >> X >> Y;
		X--;
		if (T == 1) {
			ll no = seg.get(E[X]);
			seg.set(E[X], no ^ Y);
		}
		else {
			//cout << E[X] << " @" << Af[X] << endl;
			cout << seg.prod(E[X], Af[X])<<endl;
		}
	}

}