#include <bits/stdc++.h>
const long long int M = 1e9 + 7;
using namespace std;
long long int bit[411005] = {0};
long long int a[200004];
vector<int> g[200004];
long long int lev[200004];
long long int tin[200004];
long long int tout[200004];
int v = 1;
void dfs(int s, int par) {
  tin[s] = v++;
  lev[s] = lev[par] + 1;
  for (int x : g[s]) {
    if (x != par) dfs(x, s);
  }
  tout[s] = v++;
}
void update(int idx, long long int val) {
  while (idx <= 401005) {
    bit[idx] += val;
    idx += (idx & -idx);
  }
}
long long int query(int idx) {
  long long int ans = 0;
  while (idx > 0) {
    ans += bit[idx];
    idx -= (idx & -idx);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  int n, m, q, x, y;
  ;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  lev[0] = 1;
  dfs(1, 0);
  while (m--) {
    int type;
    cin >> type;
    if (type == 1) {
      cin >> x >> y;
      if (lev[x] & 1) {
        update(tin[x], -y);
        update(tout[x], y);
      } else {
        update(tin[x], y);
        update(tout[x], -y);
      }
    } else {
      cin >> x;
      if (lev[x] & 1)
        cout << a[x] - query(tin[x]) << endl;
      else
        cout << a[x] + query(tin[x]) << endl;
    }
  }
  return 0;
}
