#include <bits/stdc++.h>
using namespace std;
long long n, a[200010], bit[400010], lv[200010], st[200010], en[200010], ti = 1;
vector<long long> v[200010];
void upd(long long x, long long val) {
  for (; x <= 2 * n; x += (x & (-x))) bit[x] += val;
  return;
}
long long qry(long long x) {
  long long rt = 0;
  for (; x > 0; x -= (x & (-x))) rt += bit[x];
  return rt;
}
void dfs(long long s, long long p) {
  st[s] = ti++;
  long long tp, i;
  for (i = 0; i < (long long)v[s].size(); i++) {
    tp = v[s][i];
    if (tp != p) {
      lv[tp] = lv[s] + 1;
      dfs(tp, s);
    }
  }
  en[s] = ti++;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long m, i, x, y;
  cin >> n >> m;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i < n; i++) {
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  lv[1] = 1;
  dfs(1, 1);
  while (m--) {
    cin >> x;
    if (x == 1) {
      cin >> x >> y;
      if (lv[x] % 2 == 0) y = -y;
      upd(st[x], y);
      upd(en[x] + 1, -y);
    } else {
      cin >> x;
      if (lv[x] % 2 == 0)
        cout << a[x] - qry(st[x]);
      else
        cout << a[x] + qry(st[x]);
      cout << "\n";
    }
  }
  return 0;
}
