#include <bits/stdc++.h>
using namespace std;
long long n, m, a[200010], p, q, bgn[200010], End[200010],
    tme = 0, op, x, val, rev[200010], bt[2][200010];
vector<long long> v[200010];
bool vis[200010] = {0}, lvl[200010];
void update(long long ft[], long long p, long long v) {
  for (; p <= n; p += p & (-p)) ft[p] += v;
}
long long query(long long ft[], long long b) {
  long long sum = 0;
  for (; b > 0; b -= b & (-b)) {
    sum += ft[b];
  }
  return sum + a[b];
}
void dfs(long long in, bool flag) {
  if (vis[in]) return;
  vis[in] = 1;
  long long sum = 1;
  bgn[in] = ++tme;
  rev[in] = tme;
  long long sz = v[in].size();
  lvl[in] = flag;
  for (long long i = 0; i < sz; i++) {
    dfs(v[in][i], !flag);
  }
  End[in] = tme;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 0; i < n - 1; i++) {
    cin >> p >> q;
    v[p].push_back(q);
    v[q].push_back(p);
  }
  dfs(1, 0);
  for (long long i = 1; i <= n; i++) {
    update(bt[lvl[i]], bgn[i], a[i]);
    update(bt[lvl[i]], bgn[i] + 1, -a[i]);
  }
  while (m--) {
    cin >> op;
    if (op == 1) {
      cin >> x >> val;
      update(bt[lvl[x]], bgn[x], val);
      update(bt[lvl[x]], End[x] + 1, -val);
      update(bt[!lvl[x]], bgn[x], -val);
      update(bt[!lvl[x]], End[x] + 1, val);
    } else if (op == 2) {
      cin >> x;
      cout << query(bt[lvl[x]], bgn[x]) << "\n";
    }
  }
  return 0;
}
