#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
int a[20050];
vector<int> s;
int in[20050];
int out[20050];
vector<int> g[20050];
int used[20005];
int cnt=0;
int tree[160050];
int dfs(int root)
{
    //cout<<root<<endl;
    in[root]=s.size();
    s.push_back(root);

    for (int i = 0; i<g[root].size(); i++)
    {
        int temp = dfs(g[root][i]);
    }
    out[root]=s.size();
    return root;
}
void build(int vr,int l, int r)
{
    if(l==r)
    {
        tree[vr]=a[s[l]-1];
        return;
    }
    int mid=(l+r)/2;
    build(2*vr,l,mid);
    build(2*vr+1,mid+1,r);
    tree[vr]=tree[2*vr]^tree[2*vr+1];
    //if()
}
int query(int vr, int l, int r, int L, int R)
{
    //cout<<l<<" "<<r<<endl;
    if(R<L)return 0;
    if(R<l||L>r)return 0;
    if(L<=l&&R>=r)return tree[vr];
    int mid=(l+r)/2;
    int p=query(2*vr,l,mid,L,R);
    int q=query(2*vr+1,mid+1,r,L,R);
    //if(s[l]==s[r])return p;
    return p^q;
}
void update(int vr, int l, int r, int L, int R, int val)
{
   // cout<<l<<" "<<r<<endl;
    if(l>r||R<l||L>r)return;
    if(l==r)
    {
        if(l==L)tree[vr]=val;
        return;
    }
    else
    {
        int mid=(l+r)/2;
        update(2*vr,l,mid,L,R,val);
        update(2*vr+1,mid+1,r,L,R,val);
        tree[vr]=tree[2*vr]^tree[2*vr+1];
    }
}
int main()
{
     ios::sync_with_stdio(false);
     cin.tie(NULL);
     cout.tie(NULL);

    freopen("xor.in","r",stdin);
    freopen("xor.out","w",stdout);
    int n,q;
    cin>>n>>q;
    for(int i=0; i<n; i++)
    {
        cin>>a[i];
    }
    for(int i=0; i<n-1; i++)
    {
        int a,b;
        cin>>a>>b;
        used[b]=1;
        g[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
    {
        if(!used[i])dfs(i);
    }
    build(1,0,s.size()-1);
    /*for(int i=0; i<s.size(); i++)
    {
        cout<<s[i]<<" ";
    }
    cout<<endl;
    for(int i=1; i<8*n; i++)
    {
        cout<<tree[i]<<" ";
    }
    cout<<endl;*/
    for(int i=0; i<q ; i++)
    {
        int k;
        cin>>k;
        if(k==1)
        {
            int a,b;
            cin>>a>>b;
            update(1,0,s.size()-1,in[a],out[a],b);
            /*for(int i=1; i<8*n; i++)
            {
                cout<<tree[i]<<" ";
            }
            cout<<endl;*/
        }

        else
        {
            int a;
            cin>>a;
            int p=tree[1];
            int q=query(1,0,s.size()-1,in[a]+1,out[a]-1);
            //cout<<q<<endl;
            cout<<(q^p)<<endl;
        }
    }
    return 0;
}
/**
4 3
1 2 4 8
1 2
2 3
3 4
2 4
1 2 5
2 3

6 0
1 2 3 4 5 6
1 2
1 3
2 6
2 5
3 4
*/