#include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){if(base==0)return 0;int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=4e4+10;

int a[maxn],n,q,start[maxn],ende[maxn],tree[maxn*4];
vector<int>vect[maxn];
vector<int>niz;

void go(int x,int prv){

    start[x]=niz.size();
    niz.pb(a[x]);
    for(int i=0;i<vect[x].size();i++){
        int id=vect[x][i];
        if(id==prv)continue;

        go(id,x);
    }
    ende[x]=niz.size();
    niz.pb(a[x]);
}
void build(int x,int l,int r){

    if(l==r){
        tree[x]=niz[l];
        return;
    }
    int mid=(l+r)/2;

    build(x*2,l,mid);
    build(x*2+1,mid+1,r);

    tree[x]=(tree[x*2]^tree[x*2+1]);
}
void update(int x,int l,int r,int id,int val){

    if(l>id || r<id)return;
    if(l==r){
        tree[x]=val;
        return;
    }
    int mid=(l+r)/2;

    update(x*2,l,mid,id,val);
    update(x*2+1,mid+1,r,id,val);

    tree[x]=(tree[x*2]^tree[x*2+1]);
}
int query(int x,int l,int r,int lp,int rp){
    if(l>rp || r<lp)return 0;
    if(l>=lp && r<=rp)return tree[x];
    int mid=(l+r)/2;
    return (query(x*2,l,mid,lp,rp)^query(x*2+1,mid+1,r,lp,rp));
}
int main(){

    freopen("xor.in","r",stdin);
    freopen("xor.out","w",stdout);


    scanf("%d %d",&n,&q);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }

    for(int i=1;i<n;i++){
        int u,v;
        scanf("%d %d",&u,&v);
        vect[u].pb(v);
        vect[v].pb(u);
    }

    go(1,0);

    build(1,0,niz.size()-1);

    /*for(int i=0;i<niz.size();i++){
        printf("%d ",niz[i]);
    }
    printf("\n");*/

    while(q--){

        int tip;
        scanf("%d",&tip);

        if(tip==1){
            int x,y;
            scanf("%d %d",&x,&y);
            update(1,0,niz.size()-1,start[x],y);
            update(1,0,niz.size()-1,ende[x],y);
        }
        else{
            int x;
            scanf("%d",&x);
            printf("%d\n",query(1,0,niz.size()-1,0,start[x]));
        }

    }

return 0;
}