import sys
sys.setrecursionlimit(10 ** 9)

class SegTree():
    def __init__(self, n, e, ope, lst=[]):
        self.N0 = 2 ** (n - 1).bit_length()
        self.e = e
        self.ope = ope
        self.data = [e] * (2 * self.N0)
        if lst:
            for i in range(n):
                self.data[self.N0 + i] = lst[i]
            for i in range(self.N0 - 1, 0, -1):
                self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
    
    def f5(self):
        for i in range(self.N0 - 1, 0, -1):
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
                
    def update(self, i, x): #a_iの値をxに更新
        i += self.N0
        self.data[i] = x
        while i > 1:
            i >>= 1
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
    
    def add(self, i, x):
        self.update(i, x + self.get(i))
    
    def query(self, l, r): #区間[l, r)での演算結果
        if r <= l:
            return self.e
            
        res = self.e
        l += self.N0
        r += self.N0
        while l < r:
            if l & 1:
                res = self.ope(res, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                res = self.ope(res, self.data[r])
            l >>= 1
            r >>= 1
        return res
            
    
    def get(self, i): #a_iの値を返す
        return self.data[self.N0 + i]

n, q = map(int, input().split())
C = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    edges[a].append(b)
    edges[b].append(a)

e = 0
def ope(x, y):
    return x ^ y
seg = SegTree(2 * n, e, ope)

left = [-1] * n
right = [-1] * n
i = -1
def dfs(pos, bpos):
    global i
    i += 1
    left[pos] = i
    seg.update(i, C[pos])
    for npos in edges[pos]:
        if npos == bpos:
            continue
        dfs(npos, pos)
    i += 1
    right[pos] = i
    
dfs(0, -1)

for _ in range(q):
    t, x, y = map(int, input().split())
    x -= 1
    if t == 1:
        p = left[x]
        seg.update(p, seg.get(p) ^ y)
    else:
        print(seg.query(left[x], right[x]))