#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2;
const int M = 1e6 + 2;
const int mod = 998244353;
const int inf = 2e9 + 3;
const long long INF = 1e16;
int n, m, a[N], pos[N], tick, sz[N], d[N];
vector<int> g[N];
struct tree {
  int t[M] = {0};
  void upd(int l, int r, int val, int v = 1, int tl = 1, int tr = n) {
    if (l <= tl && tr <= r) return void(t[v] += val);
    if (tr < l || r < tl) return;
    int tm = tl + tr >> 1;
    upd(l, r, val, v * 2, tl, tm);
    upd(l, r, val, v * 2 + 1, tm + 1, tr);
  }
  int get(int pos, int v = 1, int tl = 1, int tr = n) {
    if (tl == tr) return t[v];
    int tm = tl + tr >> 1;
    if (pos <= tm)
      return t[v] + get(pos, v * 2, tl, tm);
    else
      return t[v] + get(pos, v * 2 + 1, tm + 1, tr);
  }
} t[2];
void dfs(int v = 1, int p = 0, int c = 0) {
  pos[v] = ++tick;
  d[v] = c;
  sz[v] = 1;
  for (auto to : g[v]) {
    if (to == p) continue;
    dfs(to, v, !c);
    sz[v] += sz[to];
  }
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1, v, u; i < n; ++i) {
    scanf("%d %d", &v, &u);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs();
  for (int i = 1; i <= n; ++i) t[d[i]].upd(pos[i], pos[i], a[i]);
  while (m--) {
    int T, v, x;
    scanf("%d %d", &T, &v);
    if (T == 2) {
      printf("%d\n", t[d[v]].get(pos[v]));
    } else {
      scanf("%d", &x);
      t[d[v]].upd(pos[v], pos[v] + sz[v] - 1, x);
      t[!d[v]].upd(pos[v], pos[v] + sz[v] - 1, -x);
    }
  }
}
