import sys
readline = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=lambda x, y: x^y, default=0):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res

def non_rec_dfs(s):
    stack = []
    stack.append(~s)
    stack.append(s)
    euler_tour = []
    discovery = [-1] * N
    finishing = [-1] * N
    now = 0
    par = [-1] * N
    while stack:
        u = stack.pop()
        if u >= 0:
            stack.append(~u)
            discovery[u] = now
            euler_tour.append(u)
            for v in G[u]:
                if v == par[u]:
                    continue
                par[v] = u
                stack.append(v)
        else:
            u = ~u
            finishing[u] = now
            euler_tour.append(u)
        now += 1
    return discovery, finishing, euler_tour

N, Q = map(int, readline().split())
C = list(map(int, readline().split()))
G = [[] for i in range(N)]
for i in range(N - 1):
    A, B = map(int, readline().split())
    A, B = A - 1, B - 1
    G[A].append(B)
    G[B].append(A)
    
D, F, _ = non_rec_dfs(0)
T = SegmentTree(202020)
for i in range(N):
    T.update(D[i], C[i])    
    
for _ in range(Q):
    t, x, y = map(int, readline().split())
    x -= 1
    if t == 1:
        C[x] ^= y
        T.update(D[x], C[x])
    else:
        print(T.query(D[x], F[x] + 1))