mod = 1000000007
eps = 10**-9


def main():
    import sys
    from collections import deque
    input = sys.stdin.readline

    # adj[0] must be empty list
    def EulerTour(adj, root):
        st = [root]
        ret = []
        seen = [0] * len(adj)
        par = [0] * len(adj)
        depth = [0] * len(adj)
        while st:
            v = st.pop()
            if seen[v]:
                ret.append(v)
                continue
            ret.append(v)
            seen[v] = 1
            if par[v] != 0:
                st.append(par[v])
            for u in adj[v]:
                if seen[u] == 0:
                    st.append(u)
                    par[u] = v
                    depth[u] = depth[v] + 1

        return ret, depth

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            s = 0
            while i > 0:
                s ^= self.tree[i]
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] ^= x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    N, Q = map(int, input().split())
    C = [0] + list(map(int, input().split()))
    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a, b = map(int, input().split())
        adj[a].append(b)
        adj[b].append(a)

    ET, depth = EulerTour(adj, 1)
    L = [-1] * (N+1)
    R = [-1] * (N+1)
    seen = [0] * (N+1)
    bit = Bit(len(ET))
    for i, v in enumerate(ET):
        if not seen[v]:
            seen[v] = 1
            L[v] = i+1
            bit.add(i+1, C[v])
        R[v] = i + 1
    for _ in range(Q):
        t, x, y = map(int, input().split())
        if t == 1:
            bit.add(L[x], y)
        else:
            ans = bit.sum(R[x])
            if L[x] != 1:
                ans ^= bit.sum(L[x] - 1)
            print(ans)


if __name__ == '__main__':
    main()