#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
int n, m, a[200010], h[200010], num = 0, in[200010], out[200010], fa[200010],
                                dep[200010], dfn = 0;
struct edge {
  int to, next;
} data[200010 << 1];
struct node {
  int add, sum;
} tree[200010 << 2];
void dfs(int x) {
  in[x] = ++dfn;
  for (int i = h[x]; i; i = data[i].next) {
    int y = data[i].to;
    if (fa[x] == y) continue;
    dep[y] = dep[x] + 1;
    fa[y] = x;
    dfs(y);
  }
  out[x] = dfn;
}
inline void pushup(int p) {
  tree[p].sum = tree[p << 1].sum + tree[p << 1 | 1].sum;
}
inline void pushdown(int p, int l, int r, int mid) {
  if (!tree[p].add) return;
  tree[p << 1].add += tree[p].add;
  tree[p << 1 | 1].add += tree[p].add;
  tree[p << 1].sum += tree[p].add * (mid - l + 1);
  tree[p << 1 | 1].sum += tree[p].add * (r - mid);
  tree[p].add = 0;
}
void build(int p, int l, int r) {
  tree[p].add = tree[p].sum = 0;
  if (l == r) return;
  int mid = l + r >> 1;
  build(p << 1, l, mid);
  build(p << 1 | 1, mid + 1, r);
}
void add(int p, int l, int r, int x, int y, int val) {
  if (x <= l && r <= y) {
    tree[p].add += val;
    tree[p].sum += (r - l + 1) * val;
    return;
  }
  int mid = l + r >> 1;
  pushdown(p, l, r, mid);
  if (x <= mid) add(p << 1, l, mid, x, y, val);
  if (y > mid) add(p << 1 | 1, mid + 1, r, x, y, val);
  pushup(p);
}
int qsum(int p, int l, int r, int x) {
  if (l == r) return tree[p].sum;
  int mid = l + r >> 1;
  pushdown(p, l, r, mid);
  if (x <= mid)
    return qsum(p << 1, l, mid, x);
  else
    return qsum(p << 1 | 1, mid + 1, r, x);
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 1; i < n; ++i) {
    int x = read(), y = read();
    data[++num].to = y;
    data[num].next = h[x];
    h[x] = num;
    data[++num].to = x;
    data[num].next = h[y];
    h[y] = num;
  }
  dfs(1);
  build(1, 1, n);
  while (m--) {
    int op = read(), x = read();
    if (op == 1)
      add(1, 1, n, in[x], out[x], dep[x] % 2 ? read() : -read());
    else
      printf("%d\n", a[x] + qsum(1, 1, n, in[x]) * (dep[x] % 2 ? 1 : -1));
  }
  return 0;
}
