#include <bits/stdc++.h>
using namespace std;
struct e {
  int u, v, pre;
  e(int u = 0, int v = 0, int pre = 0) : u(u), v(v), pre(pre) {}
} edge[400005];
int adj[200005], dex, d[200005];
int st[200005], ed[200005], tre[200005], cnt, n, Q;
int a[200005];
void setIO(string a) {}
void dfs(int x, int fa) {
  st[x] = ++cnt;
  for (int i = adj[x]; i; i = edge[i].pre) {
    int v = edge[i].v;
    if (v == fa) continue;
    d[v] = d[x] + 1;
    dfs(v, x);
  }
  ed[x] = cnt;
}
void add(int x, int delta) {
  for (int p = x; p <= n; p += p & (-p)) tre[p] += delta;
}
int query(int x) {
  int an = 0;
  for (int p = x; p; p -= p & (-p)) an += tre[p];
  return an;
}
int main() {
  scanf("%d%d", &n, &Q);
  for (int i = (1); i <= (n); i++) scanf("%d", &a[i]);
  for (int i = (1); i <= (n - 1); i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    edge[++dex] = e(u, v, adj[u]);
    adj[u] = dex;
    edge[++dex] = e(v, u, adj[v]);
    adj[v] = dex;
  }
  dfs(1, 0);
  while (Q--) {
    int kd, x;
    scanf("%d%d", &kd, &x);
    if (kd == 2) {
      int an = query(st[x]);
      if (d[x] & 1) an = -an;
      an += a[x];
      printf("%d\n", an);
    } else {
      int v;
      scanf("%d", &v);
      if (d[x] & 1) v = -v;
      add(st[x], v);
      add(ed[x] + 1, -v);
    }
  }
  scanf("\n");
  return 0;
}
