#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, mod = 1e9 + 7;
int n, m;
vector<int> vec[2 * N], path;
map<int, pair<int, int> > rng;
map<int, int> mp;
int arr[2 * N], visit[2 * N] = {0}, dist[2 * N] = {0}, str[8 * N] = {0},
                          lazy[8 * N] = {0}, pos = -1;
void dfs(int a) {
  pos++;
  path.push_back(a);
  int tmp = pos;
  for (int i = 0; i < vec[a].size(); i++) {
    if (visit[vec[a][i]]) continue;
    visit[vec[a][i]]++;
    dist[vec[a][i]] = dist[a] + 1;
    dfs(vec[a][i]);
  }
  mp[tmp] = a;
  rng[a] = make_pair(tmp, pos);
}
void prop(int pos, int x, int z) {
  if (abs(dist[mp[x]] - dist[mp[x]]) % 2 == 0) {
    lazy[2 * pos + 1] += lazy[pos];
  } else {
    lazy[2 * pos + 1] -= lazy[pos];
  }
  if (abs(dist[mp[z]] - dist[mp[x]]) % 2 == 0) {
    lazy[2 * pos + 2] += lazy[pos];
  } else {
    lazy[2 * pos + 2] -= lazy[pos];
  }
  lazy[pos] = 0;
}
void updt(int l, int h, int ql, int qh, int val, int pos) {
  if (h < ql || l > qh) return;
  if (l >= ql && h <= qh) {
    int t = 1;
    if (abs(dist[mp[l]] - dist[mp[ql]]) % 2) t = -1;
    lazy[pos] += (t * val);
    return;
  }
  int mid = (l + h) / 2;
  updt(l, mid, ql, qh, val, 2 * pos + 1);
  updt(mid + 1, h, ql, qh, val, 2 * pos + 2);
}
void query(int l, int h, int q, int pos) {
  if (h < q || l > q) return;
  if (l == h) {
    cout << lazy[pos] + arr[mp[l]] << endl;
    return;
  }
  int mid = (l + h) / 2;
  if (lazy[pos]) {
    prop(pos, l, mid + 1);
  }
  if (q >= l && q <= mid)
    query(l, mid, q, 2 * pos + 1);
  else
    query(mid + 1, h, q, 2 * pos + 2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    vec[a].push_back(b);
    vec[b].push_back(a);
  }
  visit[0]++;
  dfs(0);
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    b--;
    if (a == 1) {
      int c;
      cin >> c;
      updt(0, n - 1, rng[b].first, rng[b].second, c, 0);
    } else {
      query(0, n - 1, rng[b].first, 0);
    }
  }
}
