#include <bits/stdc++.h>
using namespace std;
struct Tree {
  int start;
  int end;
  set<int> child;
  int sign;
} t[200001];
int segadd[524288];
void update(int l, int r, int v, int id = 1, int cl = 0, int cr = 262144) {
  if (l <= cl and cr <= r) {
    segadd[id] += v;
    return;
  }
  if (r <= cl or l >= cr) return;
  int x = (cl + cr) / 2;
  update(l, r, v, id * 2 + 0, cl, x);
  update(l, r, v, id * 2 + 1, x, cr);
}
int get(int x) {
  x += 262144;
  int res = 0;
  while (x > 0) {
    res += segadd[x];
    x /= 2;
  }
  return res;
}
int vertices = 1;
void prepare(int x) {
  t[x].start = vertices++;
  for (auto y : t[x].child) {
    t[y].sign = -t[x].sign;
    t[y].child.erase(x);
    prepare(y);
  }
  t[x].end = vertices;
}
int main() {
  int n, m;
  cin >> n >> m;
  int a[n];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n - 1; i++) {
    int b, c;
    cin >> b >> c;
    t[b].child.insert(c);
    t[c].child.insert(b);
  }
  t[1].sign = +1;
  prepare(1);
  for (int i = 1; i <= n; i++) {
    update(t[i].start, t[i].start + 1, a[i] * t[i].sign);
  }
  for (int i = 0; i < m; i++) {
    int j, k, l;
    cin >> j >> k;
    if (j == 1) {
      cin >> l;
      update(t[k].start, t[k].end, l * t[k].sign);
    } else {
      cout << get(t[k].start) * t[k].sign << endl;
    }
  }
}
