#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 3;
long long a[N], st[N], fin[N], depth[N], bit[N], n, m, tme = 1;
vector<vector<long long> > G(N);
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
}
void dfs(long long node, long long par) {
  st[node] = tme++;
  depth[node] = depth[par] + 1;
  for (auto child : G[node]) {
    if (child != par) {
      dfs(child, node);
    }
  }
  fin[node] = tme - 1;
}
void update(long long idx, long long val) {
  for (long long i = idx; i <= n; i += (i & -i)) {
    bit[i] += val;
  }
}
long long get(long long idx) {
  long long sum = 0;
  for (long long i = idx; i; i -= (i & -i)) {
    sum += bit[i];
  }
  return sum;
}
int main() {
  fastio();
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    G[x].push_back(y);
    G[y].push_back(x);
  }
  dfs(1, 0);
  for (long long i = 1; i <= m; i++) {
    long long typ, x;
    cin >> typ >> x;
    if (typ == 1) {
      long long val;
      cin >> val;
      if (depth[x] & 1LL) {
        update(st[x], -val);
        update(fin[x] + 1, val);
      } else {
        update(st[x], val);
        update(fin[x] + 1, -val);
      }
    } else {
      long long ans;
      if (depth[x] & 1LL) {
        ans = a[x] - get(st[x]);
      } else {
        ans = a[x] + get(st[x]);
      }
      cout << ans << "\n";
    }
  }
  return 0;
}
