#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class F> struct RecursiveLambda : private F {
    explicit constexpr RecursiveLambda(F&& f) : F(std::forward<F>(f)) {}
    template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class F> constexpr decltype(auto) rec_lambda(F&& f) {
    using G = std::decay_t<F>;
    return RecursiveLambda<G>(std::forward<G>(f));
}

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N, Q;
    std::cin >> N >> Q;
    Vec<u32> C(N);
    for (auto& x : C) {
        std::cin >> x;
    }
    Vec<Vec<usize>> graph(N);
    for (const auto i : rep(1, N)) {
        usize u, v;
        std::cin >> u >> v;
        u -= 1;
        v -= 1;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    Vec<usize> in(N), out(N);
    usize stamp = 0;
    rec_lambda([&](auto&& dfs, const usize u, const usize p) -> void {
        in[u] = stamp++;
        for (const auto v : graph[u]) {
            if (v != p) {
                dfs(v, u);
            }
        }
        out[u] = stamp;
    })(0, 0);
    Vec<u32> fen(N + 1);
    const auto add = [&](usize i, const u32 x) {
        i += 1;
        while (i <= N) {
            fen[i] ^= x;
            i += i & -i;
        }
    };
    const auto get = [&](usize i) {
        u32 x = 0;
        while (i > 0) {
            x ^= fen[i];
            i -= i & -i;
        }
        return x;
    };
    const auto fold = [&](const usize l, const usize r) { return get(l) ^ get(r); };
    for (const auto i : rep(0, N)) {
        add(in[i], C[i]);
    }
    while (Q--) {
        usize t;
        std::cin >> t;
        if (t == 1) {
            usize x;
            u32 y;
            std::cin >> x >> y;
            x -= 1;
            add(in[x], y);
        } else {
            usize x, y;
            std::cin >> x >> y;
            x -= 1;
            std::cout << fold(in[x], out[x]) << '\n';
        }
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}