#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
const int INF = 1000 * 1000 * 1000;
const long long INF64 = sqr(static_cast<long long>(INF));
const double PI = acos(-1.0);
const int N = 200500;
int n, m;
int a[N];
vector<int> g[N];
int h[N];
int tm, tin[N], tout[N];
long long tree[2][N];
void dfs(int u, int from, int ch) {
  h[u] = ch;
  tout[u] = tin[u] = tm++;
  for (int v : g[u]) {
    if (v == from) continue;
    dfs(v, u, ch ^ 1);
    tout[u] = tout[v];
  }
}
void inc(int val, int i, int j) {
  for (; i < n; i = (i | (i + 1))) tree[j][i] += val;
}
long long sum(int i, int j) {
  long long ret = 0;
  for (; i >= 0; i = (i & (i + 1)) - 1) ret += tree[j][i];
  return ret;
}
int get(int v) { return a[v] + sum(tin[v], h[v]); }
void op(int val, int u) {
  inc(val, tin[u], h[u]);
  inc(-val, tout[u] + 1, h[u]);
  inc(-val, tin[u], h[u] ^ 1);
  inc(val, tout[u] + 1, h[u] ^ 1);
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    --v;
    --u;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(0, -1, 0);
  for (int i = 0; i < m; ++i) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      int x, val;
      scanf("%d %d", &x, &val);
      op(val, x - 1);
    } else {
      int x;
      scanf("%d", &x);
      printf("%d\n", get(x - 1));
    }
  }
  return 0;
}
