#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(2e5) + 2;
const int mod = (int)(1e9) + 7;
int n, m, add[3][maxn * 3], timer, tin[maxn], t[3][maxn * 3], a[maxn],
    dep[maxn], d[maxn];
vector<int> g[maxn];
void dfs(int v, int p = 0) {
  tin[v] = ++timer;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (to == p) continue;
    dep[to] = 1 - dep[v];
    dfs(to, v);
    d[v] += d[to];
  }
}
void push(int k, int v) {
  if (add[k][v]) {
    add[k][v + v] += add[k][v];
    add[k][v + v + 1] += add[k][v];
    t[k][v + v] += add[k][v];
    t[k][v + v + 1] += add[k][v];
    add[k][v] = 0;
  }
}
int get(int k, int v, int tl, int tr, int pos) {
  if (tl == tr) return t[k][v];
  int tm = (tl + tr) >> 1;
  push(k, v);
  if (pos <= tm)
    return get(k, v + v, tl, tm, pos);
  else
    return get(k, v + v + 1, tm + 1, tr, pos);
}
void upd(int k, int v, int tl, int tr, int l, int r, int x) {
  if (l > tr || tl > r) return;
  if (l <= tl && tr <= r) {
    add[k][v] += x;
    t[k][v] += x;
    return;
  }
  push(k, v);
  int tm = (tl + tr) >> 1;
  upd(k, v + v, tl, tm, l, r, x);
  upd(k, v + v + 1, tm + 1, tr, l, r, x);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    d[i]++;
  }
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1);
  for (int i = 1; i <= n; i++) {
    upd(dep[i], 1, 1, n, tin[i], tin[i], a[i]);
  }
  for (int i = 1; i <= m; i++) {
    int type, x, val;
    cin >> type >> x;
    if (type == 1) {
      cin >> val;
      upd(dep[x], 1, 1, n, tin[x], tin[x] + d[x] - 1, val);
      upd(1 - dep[x], 1, 1, n, tin[x], tin[x] + d[x] - 1, -val);
    } else {
      cout << get(dep[x], 1, 1, n, tin[x]) << endl;
    }
  }
  return 0;
}
