#include<bits/stdc++.h>
#define MAXN 200002
#define int long long
using namespace std;
int n, q, val[MAXN], a, b, type, en[MAXN], timer, sz[MAXN], xors[MAXN], rev[MAXN], difXor[MAXN];
vector<int> M[MAXN];
int tree[5 * MAXN];
void build_tree(int ind, int l, int r)
{
    if(l == r)
    {
        tree[ind] = difXor[l];
        //cout<<l<<" "<<r<<": "<<tree[ind]<<endl;
        return;
    }
    int mid = (l + r) / 2;
    build_tree(ind * 2 + 1, l, mid);
    build_tree(ind * 2 + 2, mid + 1, r);
    tree[ind] = tree[ind * 2 + 1] ^ tree[ind * 2 + 2];
    //cout<<l<<" "<<r<<": "<<tree[ind]<<endl;
}
int query(int ind, int l, int r, int curL, int curR)
{
    if(curL > r || curR < l) return 0;
    if(curL >= l && curR <= r)
    {
        //cout<<l<<" "<<r<<": "<<tree[ind]<<endl;
        return tree[ind];
    }
    int mid = (curL + curR) / 2;
    return query(ind * 2 + 1, l, r, curL, mid) ^ query(ind * 2 + 2, l, r, mid + 1, curR);
}
void update(int ind, int indPoint, int curL, int curR, int dif)
{
    if(curL > indPoint || curR < indPoint) return;
    if(curL == indPoint && curR == indPoint)
    {
        tree[ind] ^= dif;
        return;
    }
    int mid = (curL + curR) / 2;
    if(mid >= indPoint) update(ind * 2 + 1, indPoint, curL, mid, dif);
    else update(ind * 2 + 2, indPoint, mid + 1, curR, dif);
    tree[ind] = tree[ind * 2 + 1] ^ tree[ind * 2 + 2];
}
void upd(int v, int valV)
{
    int dif = val[v] ^ valV;
    val[v] = valV;
    //cout<<"To be updated: "<<rev[v]<<" "<<rev[v] - sz[v] + 1<<" with "<<dif<<endl;
    update(0, rev[v] - sz[v] + 1, 0, n - 1, dif);
    update(0, rev[v] + 1, 0, n - 1, dif);
}
int dfs(int v, int p, int xorSubtree)
{
    xors[v] = xorSubtree;
    int subT = 1;
    for(auto to : M[v])
    {
        if(to != p)
        {
            subT += dfs(to, v, xorSubtree ^ val[to]);
        }
    }
    en[timer] = v;
    rev[v] = timer;
    timer ++;
    return sz[v] = subT;
}
void difArr()
{
    difXor[0] = xors[en[0]];
    //cout<<difXor[0]<<" ";
    for(int i = 1; i < n; i ++)
    {
        difXor[i] = xors[en[i]] ^ xors[en[i - 1]];
        //cout<<difXor[i]<<" ";
    }
    //cout<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    freopen("xor.in", "r", stdin);
    freopen("xor.out", "w", stdout);
    cin>>n>>q;//
    for(int i = 1; i <= n; i ++)
    {
        cin>>val[i];
    }
    for(int i = 0; i < n - 1; i ++)
    {
        cin>>a>>b;
        M[a].push_back(b);
        M[b].push_back(a);
    }
    dfs(1, -1, val[1]);
    difArr();
    build_tree(0, 0, n - 1);
    //upd(2, 5);
    while(q --)
    {
        cin>>type;
        if(type == 1)
        {
            cin>>a>>b;
            upd(a, b);
        }
        else
        {
            cin>>a;
            //cout<<rev[a]<<endl;
            cout<<query(0, 0, rev[a], 0, n - 1)<<'\n';
        }
    }
    return 0;
}
/*
4 3
1 2 4 8
1 2
2 3
3 4
2 4
1 2 5
2 3
*/
/*
5 5
1 2 4 8 16
1 2
1 3
3 4
3 5
2 5
1 1 16
2 5
2 4
2 3
*/