#define MOD_TYPE 1 #pragma region Macros #include using namespace std; #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #if 0 #include #include #include #include using namespace __gnu_pbds; using namespace __gnu_cxx; template using extset = tree, rb_tree_tag, tree_order_statistics_node_update>; #endif #if 0 #include #include using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr ld PI = acos(-1.0); constexpr ld EPS = 1e-7; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr istream &operator>>(istream &is, pair &p) noexcept { is >> p.first >> p.second; return is; } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion random_device seed_gen; mt19937_64 engine(seed_gen()); // -------------------------------------- template struct SegmentTree { using Fn = function; int N; vector dat; T ti; Fn f; SegmentTree() {} SegmentTree(int n, Fn f, T ti) : f(f), ti(ti) { N = 1; while (N < n) N *= 2; dat.assign(2 * N - 1, ti); } SegmentTree(const vector &v, Fn f, T ti) : f(f), ti(ti) { N = 1; int sz = v.size(); while (N < sz) N *= 2; dat.resize(2 * N - 1); for (int i = 0; i < N; ++i) dat[i + N - 1] = (i < sz ? v[i] : ti); for (int i = N - 2; i >= 0; --i) dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]); } void update(int k, T a) { k += N - 1; dat[k] = a; while (k > 0) { k = (k - 1) / 2; dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]); } } T get(int k) { return dat[k + N - 1]; } void add(int k, T a) { update(k, f(get(k), a)); } T query(int l, int r) { T vl = ti, vr = ti; for (l += (N - 1), r += (N - 1); l < r; l >>= 1, r >>= 1) { if ((l & 1) == 0) vl = f(vl, dat[l]); if ((r & 1) == 0) vr = f(vr, dat[--r]); } return f(vl, vr); } T query_all() { return dat[0]; } void display() { for (int i = 0; i < N; i++) cerr << get(i) << " "; cerr << "\n"; } }; vector E[100010]; int in[100010], out[100010]; void dfs(int v, int p, int &i) { in[v] = i++; for (auto c : E[v]) { if (c == p) continue; dfs(c, v, i); } out[v] = i; } void solve() { int n, q; cin >> n >> q; vector c(n); rep(i, n) cin >> c[i]; rep(i, n - 1) { int a, b; cin >> a >> b; a--, b--; E[a].push_back(b); E[b].push_back(a); } int tmp = 0; dfs(0, -1, tmp); auto f = [](ll a, ll b) { return a ^ b; }; SegmentTree sg(c, f, 0); rep(qi, q) { int t; ll x, y; cin >> t >> x >> y; if (t == 1) { x--; sg.add(in[x], y); } else { x--; cout << sg.query(in[x], out[x]) << "\n"; } } } int main() { solve(); }