#include <bits/stdc++.h>
const int maxn = 200000 + 10;
using namespace std;
struct Node {
  int start, end;
  int val;
  int d;
} node[maxn];
vector<int> g[maxn];
int n, m, cnt;
int c[2][maxn];
void dfs(int u, int fa, int d) {
  node[u].start = ++cnt;
  node[u].d = d;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v == fa) continue;
    dfs(v, u, 1 - d);
  }
  node[u].end = cnt;
}
void update(int *c, int idx, int val) {
  while (idx <= n) {
    c[idx] += val;
    idx += idx & -idx;
  }
}
int getsum(int *c, int idx) {
  int sum = 0;
  while (idx > 0) {
    sum += c[idx];
    idx -= idx & -idx;
  }
  return sum;
}
int main() {
  int x, y, z, u, v;
  scanf("%d %d", &n, &m);
  memset(c, 0, sizeof(c));
  for (int i = 1; i <= n; i++) scanf("%d", &node[i].val);
  for (int i = 0; i < n - 1; i++) {
    scanf("%d %d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  cnt = 0;
  dfs(1, -1, 0);
  while (m--) {
    scanf("%d", &x);
    if (x == 1) {
      scanf("%d %d", &y, &z);
      update(c[node[y].d], node[y].start, z);
      update(c[node[y].d], node[y].end + 1, -z);
    } else {
      scanf("%d", &y);
      int ans = node[y].val + getsum(c[node[y].d], node[y].start) -
                getsum(c[1 - node[y].d], node[y].start);
      cout << ans << endl;
    }
  }
  return 0;
}
