#include <bits/stdc++.h>
using namespace std;
long long hgt[200009], start[200009], en[200009], cost[200009], BIT[200009];
vector<int> a[200009];
int tim = 0;
void init(int x, int h, int p) {
  hgt[x] = h;
  start[x] = tim + 1;
  tim++;
  for (int i = 0; i < a[x].size(); i++) {
    if (a[x][i] != p) init(a[x][i], 1 - h, x);
  }
  en[x] = tim;
}
void update(int x, long long val) {
  while (x <= 200000) {
    BIT[x] += val;
    x += x & (-x);
  }
}
long long query(int x) {
  long long val = 0;
  while (x) {
    val += BIT[x];
    x -= x & (-x);
  }
  return val;
}
void solve() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &cost[i]);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    a[x].push_back(y);
    a[y].push_back(x);
  }
  init(1, 0, 0);
  for (int i = 0; i < m; i++) {
    int x;
    scanf("%d", &x);
    if (x == 1) {
      int y, z;
      scanf("%d %d", &y, &z);
      if (hgt[y] == 1) {
        update(en[y] + 1, -z);
        update(start[y], z);
      } else {
        update(en[y] + 1, z);
        update(start[y], -z);
      }
    } else {
      int y;
      scanf("%d", &y);
      if (hgt[y] == 1)
        printf("%d\n", cost[y] + query(start[y]));
      else
        printf("%d\n", cost[y] - query(start[y]));
    }
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
