#include <bits/stdc++.h>
using namespace std;
long long t, n, u, v, m, q, r, ql, qr, k, d, l, w, c, x;
const int N = 2e5 + 500;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 57LL;
const bool JUDGE = false;
int T[2][N];
int a[N];
int pos[N], depth[N], HB[N];
vector<int> adj[N];
int sz[N];
int HA = 0;
void modify(int id, int i, int v) {
  while (i <= n) {
    T[id][i] += v;
    i += (i & -i);
  }
}
int get(int id, int i) {
  int ret = 0;
  while (i > 0) {
    ret += T[id][i];
    i -= (i & -i);
  }
  return ret;
}
void dfs(int v, int p, int dep) {
  depth[v] = dep;
  pos[v] = ++HA;
  HB[HA] = v;
  sz[v] = 1;
  for (long long i = 0; i < adj[v].size(); i++) {
    int u = adj[v][i];
    if (u == p) continue;
    dfs(u, v, dep + 1);
    sz[v] += sz[u];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (JUDGE) {
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
  }
  cin >> n >> q;
  for (long long i = 0; i < n; i++) cin >> a[i + 1];
  for (long long i = 0; i < n - 1; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, -1, 0);
  for (long long i = 1; i < n + 1; i++) {
    int v = HB[i];
    modify((depth[v] & 1), pos[v], a[v]);
    modify((depth[v] & 1), pos[v] + 1, -a[v]);
  }
  while (q--) {
    int id;
    cin >> id;
    if (id == 1) {
      cin >> v >> x;
      int g = depth[v] & 1;
      int f = g ^ 1;
      modify(g, pos[v], x);
      modify(g, pos[v] + sz[v], -x);
      modify(f, pos[v], -x);
      modify(f, pos[v] + sz[v], x);
    } else {
      cin >> v;
      int f = depth[v] & 1;
      cout << get(f, pos[v]) << '\n';
    }
  }
  return 0;
}
