#include <bits/stdc++.h>
using namespace std;
const int MAXINT = 1 << 31 - 1;
const long long MAXLONG = (long long)1 << 63 - 1;
const int MAXN = 2 * 1e5 + 10;
const int MAXN4 = 4 * MAXN;
int odd[MAXN4], eve[MAXN4], arr[MAXN], sta[MAXN], fin[MAXN], level[MAXN];
vector<int> gra[MAXN];
int n, m, tt;
void dfs(int u, int par, int lev) {
  level[u] = lev;
  sta[u] = tt;
  tt++;
  for (int i = (0); i < (gra[u].size()); i += 1) {
    int v = gra[u][i];
    if (v == par) continue;
    dfs(v, u, lev + 1);
  }
  fin[u] = tt;
  tt++;
}
void update(int arr[], int val, int x) {
  int cur = x;
  while (cur < MAXN4) {
    arr[cur] += val;
    cur += cur & (-cur);
  }
}
int query(int arr[], int x) {
  int cur = x;
  int res = 0;
  while (cur >= 1) {
    res += arr[cur];
    cur -= cur & (-cur);
  }
  return res;
}
int main() {
  while (scanf("%d %d", &n, &m) != -1) {
    for (int i = (1); i < (n + 1); i += 1) {
      scanf("%d", &arr[i]);
    }
    memset(odd, 0, sizeof(odd));
    memset(eve, 0, sizeof(eve));
    for (int i = (0); i < (n - 1); i += 1) {
      int x, y;
      scanf("%d %d", &x, &y);
      gra[x].push_back(y);
      gra[y].push_back(x);
    }
    tt = 1;
    dfs(1, -1, 1);
    for (int i = (0); i < (m); i += 1) {
      int type;
      scanf("%d", &type);
      if (type == 1) {
        int x, val;
        scanf("%d %d", &x, &val);
        if (level[x] % 2 == 0) {
          update(eve, val, sta[x]);
          update(eve, -val, fin[x] + 1);
          update(odd, -val, sta[x]);
          update(odd, val, fin[x] + 1);
        } else {
          update(odd, val, sta[x]);
          update(odd, -val, fin[x] + 1);
          update(eve, -val, sta[x]);
          update(eve, val, fin[x] + 1);
        }
      } else {
        int x, res;
        scanf("%d", &x);
        if (level[x] % 2 == 0) {
          res = query(eve, sta[x]);
        } else {
          res = query(odd, sta[x]);
        }
        res += arr[x];
        printf("%d\n", res);
      }
    }
  }
  return 0;
}
