#include <bits/stdc++.h>
using namespace std;
const int MX = 200005;
const int BLOCK = 350;
int n, q, a[MX];
vector<int> adj[MX];
int depth[MX], tin[MX], tout[MX], tim = 0;
void dfs(int nw, int bf) {
  tin[nw] = ++tim;
  for (int nx : adj[nw])
    if (nx != bf) {
      depth[nx] = depth[nw] + 1;
      dfs(nx, nw);
    }
  tout[nw] = tim;
}
int fwt[MX];
void upd(int ps, int v) {
  for (; ps < MX; ps += ps & -ps) fwt[ps] += v;
}
int que(int ps) {
  int r = 0;
  for (; ps > 0; ps -= ps & -ps) r += fwt[ps];
  return r;
}
void range_upd(int lf, int rg, int v) {
  upd(lf, v);
  upd(rg + 1, -v);
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int u, v, i = 1; i < n; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, -1);
  for (int tp, ps, val; q--;) {
    cin >> tp >> ps;
    if (tp == 1) {
      cin >> val;
      if (depth[ps] % 2) val *= -1;
      range_upd(tin[ps], tout[ps], val);
    } else {
      int ans = que(tin[ps]);
      if (depth[ps] % 2) ans *= -1;
      cout << a[ps] + ans << "\n";
    }
  }
  return 0;
}
