#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000

vector<int> C;
vector<int> D;
vector<vector<int>> E;

void dfs(int cur,int p){
	rep(i,E[cur].size()){
		int to = E[cur][i];
		if(to==p)continue;
		dfs(to,cur);
		D[cur] ^= D[to];
	}
	D[cur] ^= C[cur];
}

struct lca{
	
	vector<int> depth;
	vector<vector<int>> parents;
	
	int max_j=18;
	
	lca(int n,vector<vector<int>> &E){
		depth.assign(E.size(),-1);
		parents.assign(E.size(),vector<int>(max_j,-1));
		
		rep(i,100){
			if((1<<i)>E.size()){
				max_j = i;
				break;
			}
		}
		
		stack<int> s;
		s.push(n);
		depth[n] = 0;
		while(s.size()!=0){
			int k = s.top();
			s.pop();
			for(int i=0;i<E[k].size();i++){
				int x = E[k][i];
				if(depth[x]!=-1)continue;
				s.push(x);
				depth[x] = depth[k]+1;
				for(int j=0;j<max_j;j++){
					if(j==0){
						parents[x][j] = k;
					}
					else{
						parents[x][j] = parents[parents[x][j-1]][j-1];
					}
					if(parents[x][j] == -1)break;
				}
			}
		}
	}
	
	
	int kth_parent(int u,int k){
		for(int i=0;i<max_j;i++){
			if(k==0)break;
			if(u==-1)break;
			if(k%2){
				u = parents[u][i];
			}
			k/=2;
		}
		return u;
	}
	
	int query(int u,int v){
		if(depth[u]<depth[v])swap(u,v);
		u = kth_parent(u,depth[u]-depth[v]);
		
		if(u==v){
			return u;
		}
		
		for(int i=max_j-1;i>=0;i--){
			if(parents[u][i]!=parents[v][i]){
				u = parents[u][i];
				v = parents[v][i];
			}
		}
		
		return parents[u][0];
		
	}
	
	int get_distance(int u,int v){
		return depth[u]+depth[v]-2*depth[query(u,v)];
	}
	
	
};

int main(){
	
	int N,Q;
	cin>>N>>Q;
	
	C.resize(N);
	D.resize(N,0);
	rep(i,N)cin>>C[i];
	E.resize(N);
	rep(i,N-1){
		int a,b;
		scanf("%d %d",&a,&b);
		a--;b--;
		E[a].push_back(b);
		E[b].push_back(a);
	}
	
	dfs(0,-1);
	
	lca L(0,E);
	
	vector<int> x,y;
	rep(_,Q){
		int T;
		cin>>T;
		int a,b;
		scanf("%d %d",&a,&b);
		a--;
		if(T==1){
			x.push_back(a);
			y.push_back(b);
		}
		else{
			int ans = D[a];
			rep(i,x.size()){
				if(L.query(a,x[i])==a)ans ^= y[i];
			}
			printf("%d\n",ans);
		}
		
		
		if(x.size()>200){
			while(x.size()>0){
				C[x.back()] ^= y.back();
				x.pop_back();
				y.pop_back();
			}
			D.assign(N,0);
			dfs(0,-1);
		}
	}
	
	return 0;
}