#include <bits/stdc++.h>
using namespace std;
const int MX = 212345;
int clk, vlu[MX], level[MX], st[MX], ed[MX];
int lazy_even[3 * MX][2], lazy_odd[3 * MX][2];
bool vis[MX];
vector<int> adjcnt[MX];
void dfs(int p, int u) {
  vis[u] = true;
  st[u] = ++clk;
  level[u] = level[p] + 1;
  for (int i = 0, sz = adjcnt[u].size(); i < sz; i++) {
    if (!vis[adjcnt[u][i]]) dfs(u, adjcnt[u][i]);
  }
  ed[u] = clk;
}
void propagate(int node, int lo, int hi, int tgl) {
  tgl == 1 ? lazy_odd[node][1] += lazy_odd[node][0]
           : lazy_even[node][1] += lazy_even[node][0];
  if (lo != hi) {
    int lft = node << 1, rgt = lft | 1;
    if (tgl == 1) {
      lazy_odd[lft][0] += lazy_odd[node][0];
      lazy_odd[rgt][0] += lazy_odd[node][0];
    } else {
      lazy_even[lft][0] += lazy_even[node][0];
      lazy_even[rgt][0] += lazy_even[node][0];
    }
  }
  tgl == 1 ? lazy_odd[node][0] = 0 : lazy_even[node][0] = 0;
}
void update(int node, int lo, int hi, int l, int r, int v, int tgl) {
  if (tgl == 1 && lazy_odd[node][0] != 0) {
    propagate(node, lo, hi, 1);
  }
  if (tgl == 2 && lazy_even[node][0] != 0) {
    propagate(node, lo, hi, 2);
  }
  if (lo > r || hi < l) return;
  if (lo >= l && hi <= r) {
    if (tgl == 1) {
      lazy_odd[node][0] += v;
      propagate(node, lo, hi, 1);
    } else {
      lazy_even[node][0] += v;
      propagate(node, lo, hi, 2);
    }
    return;
  }
  int mid = lo + (hi - lo) / 2, lft = node << 1, rgt = lft | 1;
  update(lft, lo, mid, l, r, v, tgl);
  update(rgt, mid + 1, hi, l, r, v, tgl);
}
int query(int node, int lo, int hi, int p, int tgl) {
  if (tgl == 1 && lazy_odd[node][0] != 0) {
    propagate(node, lo, hi, 1);
  }
  if (tgl == 2 && lazy_even[node][0] != 0) {
    propagate(node, lo, hi, 2);
  }
  if (lo == hi) {
    return (tgl == 1) ? lazy_odd[node][1] : lazy_even[node][1];
  }
  int mid = lo + (hi - lo) / 2, lft = node << 1, rgt = lft | 1;
  if (p <= mid)
    return query(lft, lo, mid, p, tgl);
  else
    return query(rgt, mid + 1, hi, p, tgl);
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", vlu + i);
  }
  for (int i = 1, a, b; i < n; i++) {
    scanf("%d %d", &a, &b);
    adjcnt[a].push_back(b);
    adjcnt[b].push_back(a);
  }
  clk = 0, level[0] = 0;
  dfs(0, 1);
  while (m--) {
    int op, a, b;
    scanf("%d %d", &op, &a);
    if (op == 1) {
      scanf("%d", &b);
      if (level[a] & 1) {
        update(1, 1, clk, st[a], ed[a], b, 1);
        update(1, 1, clk, st[a], ed[a], -b, 2);
      } else {
        update(1, 1, clk, st[a], ed[a], b, 2);
        update(1, 1, clk, st[a], ed[a], -b, 1);
      }
    } else {
      int ans;
      ans = (level[a] & 1) ? query(1, 1, clk, st[a], 1)
                           : query(1, 1, clk, st[a], 2);
      printf("%d\n", ans + vlu[a]);
    }
  }
  return 0;
}
