#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint1000000007;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};

template<typename Monoid>
struct SegmentTree{
    int n;
    vector<Monoid> node;

    SegmentTree(vector<Monoid> v){
        int k = v.size();
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,0); //単位元で初期化
        for(int i = 0; i < k; i++) node[i+n-1] = v[i];
        for(int i = n-2; i >= 0; i--) node[i] = node[2*i+1]^node[2*i+2]; //書き換える
    }

    SegmentTree(int k){
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,0); //書き換える
    }

    void update(int k, Monoid x){
        k += n-1;
        node[k] = x;
        while(k > 0){
            k = (k-1)/2;
            node[k] = node[2*k+1]^node[2*k+2]; //書き換える
        }
    }

    //[a,b)のクエリに答える
    Monoid query(int a, int b, int k = 0, int l = 0, int r = -1){
        if(r < 0) r = n;
        if(b <= l || a >= r) return 0;
        if(a <= l && b >= r) return node[k];
        else{
            Monoid s = query(a,b,2*k+1,l,(l+r)/2);
            Monoid t = query(a,b,2*k+2,(l+r)/2,r);
            return s^t; //書き換える
        }
    }
};


int n,q;
vector<vector<int>> G;
vector<int> c;
int in[100010];
int out[100010];
int counter = 0;

void dfs(int u, int p = -1){
    in[u] = counter++;
    for(auto v : G[u]){
        if(v == p) continue;
        dfs(v,u);
    }
    out[u] = counter;
}

int main(){
    cin >> n >> q;
    G.resize(n);
    c.resize(n);
    rep(i,n) cin >> c[i];
    rep(i,n-1){
        int a,b; cin >> a >> b;
        a--; b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    dfs(0);

    SegmentTree<int> seg(n);
    rep(i,n){
        seg.update(in[i],c[i]);
    }
    while(q--){
        int t,x,y; cin >> t >> x >> y;
        x--;
        if(t == 1){
            int u = seg.query(in[x],in[x]+1);
            seg.update(in[x],u^y);
        }
        else{
            cout << seg.query(in[x],out[x]) << endl;
        }
    }
}