#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 10;
int n, m, a[N], b[N], s_time[N], f_time[N], t, seg[N << 2][2], ans;
bool dis[N];
vector<int> adj[N];
void read_input() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n - 1; i++) {
    int v, u;
    cin >> u >> v;
    u--, v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
}
void dfs(int v) {
  s_time[v] = ++t;
  for (int u : adj[v])
    if (!s_time[u]) {
      dis[u] = !dis[v];
      dfs(u);
    }
  f_time[v] = t;
}
void add(int L, int R, bool d, int val, int st = 1, int en = n + 1,
         int id = 1) {
  if (en <= L || st >= R) return;
  if (L <= st && en <= R) {
    seg[id][d] += val, seg[id][!d] -= val;
    return;
  }
  int mid = (st + en) >> 1;
  add(L, R, d, val, st, mid, id << 1), add(L, R, d, val, mid, en, id << 1 | 1);
}
void get(int p, bool d, int st = 1, int en = n + 1, int id = 1) {
  if (st > p || en <= p) return;
  ans += seg[id][d];
  if (en - st == 1) return;
  int mid = (st + en) >> 1;
  if (p < mid)
    get(p, d, st, mid, id << 1);
  else
    get(p, d, mid, en, id << 1 | 1);
}
void write_output() {
  while (m--) {
    int opr, x, val;
    cin >> opr >> x;
    x--;
    if (opr == 1) {
      cin >> val;
      add(s_time[x], f_time[x] + 1, dis[x], val);
    } else {
      ans = 0;
      get(s_time[x], dis[x]);
      cout << ans + a[x] << '\n';
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  read_input(), dfs(0), write_output();
  return 0;
}
