#include <bits/stdc++.h>
using namespace std;
int n, m, a[200001], x, y, z, second[200001], e[200001], k, st[1600001],
    lz[1600001], h[200001];
vector<int> v[200001];
void dfs(int x, int p) {
  second[x] = ++k;
  for (int i = 0; i < v[x].size(); i++) {
    if (v[x][i] == p) continue;
    h[v[x][i]] = h[x] + 1;
    dfs(v[x][i], x);
  }
  e[x] = ++k;
}
void push(int v) {
  st[v * 2] += lz[v];
  st[v * 2 + 1] += lz[v];
  lz[v * 2] += lz[v];
  lz[v * 2 + 1] += lz[v];
  lz[v] = 0;
}
void upd(int v, int A, int B, int l, int r, int x) {
  if (l > B || r < A) return;
  if (A == l && B == r) {
    st[v] += x;
    lz[v] += x;
    return;
  }
  push(v);
  int mid = (A + B) / 2;
  upd(v * 2, A, mid, l, min(mid, r), x);
  upd(v * 2 + 1, mid + 1, B, max(mid + 1, l), r, x);
}
int qr(int v, int A, int B, int x) {
  if (A == B) return st[v];
  push(v);
  int mid = (A + B) / 2;
  if (x <= mid)
    return qr(v * 2, A, mid, x);
  else
    return qr(v * 2 + 1, mid + 1, B, x);
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i < n; i++)
    cin >> x >> y, v[x].push_back(y), v[y].push_back(x);
  dfs(1, 0);
  while (m--) {
    cin >> x >> y;
    if (x == 1) {
      cin >> z;
      if (h[y] % 2)
        upd(1, 1, k, second[y], e[y], -z);
      else
        upd(1, 1, k, second[y], e[y], z);
    } else if (h[y] % 2)
      cout << a[y] - qr(1, 1, k, second[y]) << endl;
    else
      cout << a[y] + qr(1, 1, k, second[y]) << endl;
  }
  return 0;
}
