#include <bits/stdc++.h>
using namespace std;
const int sq = 3000;
const int maxn = 2e5 + 10;
long long int a[maxn];
vector<pair<int, int>> v;
vector<int> adj[maxn];
int startingtime[maxn];
int finishingtime[maxn];
int h[maxn];
long long int b[maxn];
long long int c[maxn];
int n;
int m;
int cnt;
void nfa(int s, int pr) {
  a[s] += b[s];
  a[s] -= c[s];
  for (int i = 0; i < adj[s].size(); i++) {
    if (adj[s][i] != pr) {
      b[adj[s][i]] += c[s];
      c[adj[s][i]] += b[s];
      nfa(adj[s][i], s);
    }
  }
  b[s] = 0;
  c[s] = 0;
}
void upd() {
  for (int i = 0; i < v.size(); i++) {
    b[v[i].first] += v[i].second;
  }
  v.clear();
  nfa(1, -1);
}
void dfs(int s, int pr) {
  startingtime[s] = cnt;
  cnt++;
  for (int i = 0; i < adj[s].size(); i++) {
    if (adj[s][i] != pr) {
      dfs(adj[s][i], s);
    }
  }
  finishingtime[s] = cnt;
  return;
}
void dfa(int s, int pr) {
  for (int i = 0; i < adj[s].size(); i++) {
    if (adj[s][i] != pr) {
      h[adj[s][i]] = h[s] + 1;
      dfa(adj[s][i], s);
    }
  }
  return;
}
int main() {
  scanf("%d", &n);
  scanf("%d", &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i < n; i++) {
    int l;
    int r;
    scanf("%d", &l);
    scanf("%d", &r);
    adj[l].push_back(r);
    adj[r].push_back(l);
  }
  dfs(1, -1);
  h[1] = 1;
  dfa(1, -1);
  for (int i = 0; i < m; i++) {
    int g;
    scanf("%d", &g);
    if (g == 2) {
      int l;
      scanf("%d", &l);
      long long int f = a[l];
      for (int j = 0; j < v.size(); j++) {
        if (startingtime[v[j].first] <= startingtime[l] &&
            finishingtime[v[j].first] >= finishingtime[l]) {
          if ((h[l] - h[v[j].first]) % 2 == 1) {
            f -= v[j].second;
          } else {
            f += v[j].second;
          }
        }
      }
      printf("%d\n", f);
    } else {
      int l;
      int r;
      scanf("%d", &l);
      scanf("%d", &r);
      v.push_back({l, r});
      if (v.size() == sq) {
        upd();
      }
    }
  }
  return 0;
}
