#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<int> g[N];
int st[N], en[N], ti, a[N], L[N];
void build(int u, int p) {
  st[u] = ++ti;
  for (int v : g[u])
    if (v != p) L[v] = L[u] ^ 1, build(v, u);
  en[u] = ti;
}
long long ft[N][2];
void add(int id, int x, int val) {
  for (; x < N; x += x & -x) ft[x][id] += val;
}
void add(int id, int i, int j, int val) {
  add(id, i, val);
  add(id, j + 1, -val);
}
long long sum(int id, int x) {
  long long ans = 0;
  for (; x > 0; x -= x & -x) ans += ft[x][id];
  return ans;
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  build(1, 1);
  for (int i = 1; i <= n; i++) add(L[i], st[i], st[i], a[i]);
  int t, x, val;
  while (m--) {
    scanf("%d %d", &t, &x);
    if (t == 1) {
      scanf("%d", &val);
      add(L[x], st[x], en[x], val);
      add(L[x] ^ 1, st[x], en[x], -val);
    } else {
      printf("%lld\n", sum(L[x], st[x]));
    }
  }
}
