#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 5;
int n, q;
int seg[4 * M], lazy[4 * M][2], t[M];
vector<int> adj[M];
int st[M], en[M], id[M], hi[M];
int dfsnum;
int s, e, val, p;
void dfs(int x, int p) {
  st[x] = dfsnum;
  id[dfsnum++] = x;
  hi[x] = hi[p] + 1;
  for (int i : adj[x]) {
    if (i == p) continue;
    dfs(i, x);
  }
  en[x] = dfsnum - 1;
}
void fix(int nd, int l, int r) {
  if (l != r) {
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < 2; j++) lazy[nd * 2 + i][j] += lazy[nd][j];
  } else {
    seg[nd] += lazy[nd][hi[id[l]] % 2];
    seg[nd] -= lazy[nd][1 - hi[id[l]] % 2];
  }
  lazy[nd][0] = lazy[nd][1] = 0;
}
void build(int nd, int l, int r) {
  if (l == r) {
    seg[nd] += t[id[l]];
    return;
  }
  int mid = (l + r) / 2;
  build(nd * 2, l, mid);
  build(nd * 2 + 1, mid + 1, r);
}
void update(int nd, int l, int r) {
  fix(nd, l, r);
  if (r < s || e < l) return;
  if (s <= l && r <= e) {
    lazy[nd][p] += val;
    fix(nd, l, r);
    return;
  }
  int mid = (l + r) / 2;
  update(nd * 2, l, mid);
  update(nd * 2 + 1, mid + 1, r);
}
int get(int nd, int l, int r) {
  fix(nd, l, r);
  if (r < s || e < l) return 0;
  if (s <= l && r <= e) return seg[nd];
  int mid = (l + r) / 2;
  return get(nd * 2, l, mid) + get(nd * 2 + 1, mid + 1, r);
}
int main() {
  scanf("%d %d", &n, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(1, 0);
  build(1, 0, n - 1);
  while (q--) {
    int t, x;
    scanf("%d %d", &t, &x);
    if (t == 1) {
      int v;
      scanf("%d", &v);
      s = st[x], e = en[x], val = v, p = hi[x] % 2;
      update(1, 0, n - 1);
    } else {
      s = st[x], e = st[x];
      printf("%d\n", get(1, 0, n - 1));
    }
  }
}
