#include <bits/stdc++.h>
using namespace std;
void err(istringstream &iss) {}
template <typename T, typename... Args>
void err(istringstream &iss, const T &varVal, const Args &...args) {
  string varName;
  iss >> varName;
  if (varName.back() == ',') varName.back() = ' ';
  cout << varName << " = " << varVal << "; ", err(iss, args...);
}
int n, m, K, T, Q, cn;
struct BIT {
  bool zeroIndxd = 0;
  static const int mxIdx = 200005 << 1;
  long long tree[mxIdx + 2] = {0};
  void addAtIdx(int idx, long long val) {
    idx += zeroIndxd;
    while (idx <= mxIdx) tree[idx] += val, idx += (idx & -idx);
  }
  long long getPrefixSum(int idx) {
    idx += zeroIndxd;
    long long sum = 0;
    while (idx > 0) sum += tree[idx], idx -= (idx & -idx);
    return sum;
  }
  int lower_bound(long long x) {
    int idx = 0, mask = 1 << (31 - __builtin_clz(200005 - 1)), ret = 200005;
    while (mask) {
      int tIdx = idx + mask;
      mask >>= 1;
      if (tIdx >= 200005 || tIdx <= 0) continue;
      if (tree[tIdx] >= x) ret = min(ret, tIdx);
      if (tree[tIdx] < x) idx = tIdx, x -= tree[tIdx];
    }
    ret -= zeroIndxd;
    return ret;
  }
  void multiplyAll(long long c) {
    for (int i = 1; i <= 200005; i++) tree[i] *= c;
  }
};
int a[200005], t, x, val, tiks, disc[200005], finish[200005], lvl[200005];
list<int> adj[200005];
void dfs(int u, int par, int dist) {
  lvl[u] = dist, disc[u] = ++tiks;
  for (auto &v : adj[u])
    if (v != par) {
      dfs(v, u, dist + 1);
    }
  finish[u] = ++tiks;
}
int main() {
  cin.tie(NULL);
  scanf("%d%d", &n, &Q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v), adj[v].push_back(u);
  }
  dfs(1, -1, 0);
  BIT ft;
  while (Q--) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d%d", &x, &val);
      if (lvl[x] & 1) val = -val;
      ft.addAtIdx(disc[x], val), ft.addAtIdx(finish[x], -val);
    } else
      scanf("%d", &x),
          printf("%lld\n",
                 ((lvl[x] & 1) ? -1 : 1) * ft.getPrefixSum(disc[x]) + a[x]);
  }
  return 0;
}
