using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, q) = (c[0], c[1]);
        c = NList;
        var map = NArr(n - 1);
        var query = NArr(q);
        var tree = new List<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
        }
        var left = new int[n];
        var right = new int[n];
        var pos = 0;
        DFS(-1, 0, ref pos, tree, left, right);
        var seg = new XorSegmentTree(n * 2);
        for (var i = 0; i < n; ++i) seg.Update(left[i], c[i]);
        var ans = new List<int>();
        foreach (var que in query)
        {
            if (que[0] == 1)
            {
                seg.Update(left[que[1] - 1], seg.Find(left[que[1] - 1], left[que[1] - 1] + 1) ^ que[2]);
            }
            else
            {
                ans.Add(seg.Find(left[que[1] - 1], right[que[1] - 1]));
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    static void DFS(int prev, int cur, ref int pos, List<int>[] tree, int[] left, int[] right)
    {
        left[cur] = pos++;
        foreach (var next in tree[cur])
        {
            if (prev == next) continue;
            DFS(cur, next, ref pos, tree, left, right);
        }
        right[cur] = pos++;
    }
    class XorSegmentTree
    {
        public int[] tree { get; private set; }
        int INF = 0;
        public XorSegmentTree(int _n)
        {
            var x = 1;
            while (_n > x) x *= 2;
            var n = x * 2;
            tree = Enumerable.Repeat(INF, n).ToArray();
        }
        public XorSegmentTree(int[] valueList)
        {
            var _n = valueList.Length;
            var x = 1;
            while (_n > x) x *= 2;
            var n = x * 2;
            tree = Enumerable.Repeat(INF, n).ToArray();
            for (var i = 0; i < valueList.Length; ++i) tree[i + tree.Length / 2] = valueList[i];
            for (var i = tree.Length / 2 - 1; i > 0; --i) tree[i] = tree[i * 2] ^ tree[i * 2 + 1];
        }
        public void Update(int index, int value)
        {
            var idx = index + tree.Length / 2;
            tree[idx] = value;
            while (idx > 1)
            {
                var parent = idx / 2;
                var siblings = idx + 1 - (idx % 2) * 2;
                tree[parent] = tree[idx] ^ tree[siblings];
                idx = parent;
            }
        }
        public int Find(int a, int b)
        {
            return Find(a, b, 1, 0, tree.Length / 2);
        }
        int Find(int a, int b, int k, int l, int r)
        {
            if (r <= a || b <= l) return INF;
            if (a <= l && r <= b) return tree[k];
            return Find(a, b, k * 2, l, (l + r) / 2) ^ Find(a, b, k * 2 + 1, (l + r) / 2, r);
        }
        /// <summary>aおよびその右側から、val以上の値を持つ一番左のインデックスを取得する</summary>
        public int FindLeft(int a, int val, int b = -1, int k = 1, int l = 0, int r = -1)
        {
            if (b < 0) b = tree.Length / 2;
            if (r < 0) r = tree.Length / 2;
            if (r <= a || b <= l) return tree.Length;
            if (a <= l && r <= b)
            {
                if (tree[k] >= val)
                {
                    if (r - l > 1)
                    {
                        var idx = FindLeft(a, val, b, k * 2, l, (l + r) / 2);
                        if (idx < tree.Length) return idx;
                        return FindLeft(a, val, b, k * 2 + 1, (l + r) / 2, r);
                    }
                    else return l;
                }
                else return tree.Length;
            }
            return FindLeft(a, val, b, k * 2, l, (l + r) / 2) ^ FindLeft(a, val, b, k * 2 + 1, (l + r) / 2, r);
        }
    }
}