#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
struct Op {
  int ty;
  int val;
  int id;
};
int ans[MAXN];
int f[2][MAXN];
bool out[MAXN];
int n, m;
vector<int> g[MAXN];
int a[MAXN];
vector<Op> q[MAXN];
void update(int* f, int x, int val) {
  while (x < m) {
    f[x] += val;
    x |= (x + 1);
  }
}
int sum(int* f, int x) {
  int ret = 0;
  while (x >= 0) {
    ret += f[x];
    x &= (x + 1);
    x--;
  }
  return ret;
}
void go(int v, int dep, int pr) {
  for (int i = 0; i < (int)(q[v].size()); i++) {
    if (q[v][i].ty == 1) {
      update(f[dep], q[v][i].id, q[v][i].val);
    }
  }
  for (int i = 0; i < (int)(q[v].size()); i++) {
    if (q[v][i].ty == 2) {
      ans[q[v][i].id] =
          a[v] + sum(f[dep], q[v][i].id) - sum(f[dep ^ 1], q[v][i].id);
    }
  }
  for (int i = 0; i < (int)(g[v].size()); i++) {
    int u = g[v][i];
    if (u != pr) go(u, dep ^ 1, v);
  }
  for (int i = 0; i < (int)(q[v].size()); i++) {
    if (q[v][i].ty == 1) {
      update(f[dep], q[v][i].id, -q[v][i].val);
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < (int)(n); i++) scanf("%d", &a[i]);
  for (int i = 0; i < (int)(n - 1); i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--, y--;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 0; i < (int)(m); i++) {
    int v;
    Op op;
    scanf("%d %d", &op.ty, &v);
    v--;
    if (op.ty == 1) {
      scanf("%d", &op.val);
    } else
      out[i] = true;
    op.id = i;
    q[v].push_back(op);
  }
  go(0, 0, -1);
  for (int i = 0; i < (int)(m); i++)
    if (out[i]) {
      printf("%d\n", ans[i]);
    }
  return 0;
}
