def main():
    import sys
    sys.setrecursionlimit(10**8)
    input = sys.stdin.readline
    N,Q = map(int,input().split())
    C = list(map(int,input().split()))
    def f(n):
        return int(n) - 1
    ab = [list(map(f,input().split())) for _ in range(N-1)]
    # txy = [list(map(int,input().split())) for _ in range(Q)]
    e = [[] for _ in range(N)]
    for i in range(N-1):
        a,b = ab[i]
        e[a].append(b)
        e[b].append(a)
    sum = [0 for _ in range(N)]
    d = [[0,0] for _ in range(N)]
    l = [0 for _ in range(N)]
    def euler(n,k):
        d[n][0] = k
        l[n] = 1
        now = k
        for i in e[n]:
            if l[i] == 1:
                continue
            qqq = euler(i,now+1)
            now = qqq
        d[n][1] = now + 1
        return (now + 1)
    euler(0,0)

    import math
    def dfs(n):
        l[n] = 1
        sum[n] = C[n]
        for i in e[n]:
            if l[i]:
                continue
            s = dfs(i)
            sum[n] ^= s
        return sum[n]
    q = math.floor(math.sqrt(Q))
    nowq = 0
    while True:
        for i in range(N):
            l[i] = 0
        dfs(0)
        p = 1
        txy = []
        for i in range(q):
            nq = q * nowq + i
            if nq >= Q:
                p = 0
                break
            txy.append(list(map(int,input().split())))
            if txy[i][0] == 1:
                continue
            s = sum[txy[i][1]-1]
            for j in range(i):
                # nnq = q * nowq + j
                # nt,nx,ny = txy[j]
                if txy[j][0] == 2:
                    continue
                nx -= 1
                if d[txy[i][1]-1][0] <= d[txy[j][1]-1][0] <= d[txy[i][1]-1][1]:
                    s ^= txy[j][2]
            print(s)
        if not p:
            break
        for i in range(q):
            if txy[i][0] == 2:
                continue
            C[txy[i][1]-1] ^= txy[i][2]
        nowq += 1

if __name__ == '__main__':
    main()