#include <bits/stdc++.h>
using namespace std;
const char IO_MODE = 0;
inline long long ReadInt() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void WriteInt(long long x) {
  char CH[20];
  int Num = 0;
  if (!x) {
    putchar('0');
    return;
  }
  while (x > 0) CH[++Num] = x % 10, x /= 10;
  while (Num) putchar(CH[Num--] + 48);
}
inline void out(int x) {
  if (IO_MODE & 1)
    WriteInt(x);
  else
    printf("%i", x);
}
template <typename... Args>
inline void out(int x, Args... args) {
  out(x);
  putc(' ', stdout);
  out(args...);
}
inline void in(int &x) {
  if (IO_MODE & 2)
    x = ReadInt();
  else
    scanf("%i", &x);
}
template <typename... Args>
inline void in(int &x, Args &...args) {
  in(x);
  in(args...);
}
inline void outll(long long x) {
  if (IO_MODE & 1)
    WriteInt(x);
  else
    printf("%I64d", x);
}
template <typename... Args>
inline void outll(long long x, Args... args) {
  outll(x);
  putc(' ', stdout);
  outll(args...);
}
inline void inll(long long &x) {
  if (IO_MODE & 2)
    x = ReadInt();
  else
    scanf("%I64d", &x);
}
template <typename... Args>
inline void inll(long long &x, Args &...args) {
  inll(x);
  inll(args...);
}
int aa, bb, cc, dd, ee, ff, gg, hh, ii, jj, kk, mm, nn, oo, pp, qq, rr, ss, tt,
    uu, vv, ww, xx, yy, zz;
int tc, ty;
int n, m;
int A[200100];
int In[200100], Out[200100];
int Lev[200100];
vector<vector<int>> adjList;
struct fenwick {
  int n;
  vector<int> fn;
  fenwick(int sz = 200100) {
    n = sz;
    fn.assign(n + 2, 0);
  }
  void upd(int L, int R, int val) {
    for (int i = L; i <= n; i += i & -i) fn[i] += val;
    for (int i = R + 1; i <= n; i += i & -i) fn[i] -= val;
  }
  int qry(int i) {
    int ret = 0;
    for (; i; i -= i & -i) ret += fn[i];
    return ret;
  }
} fn[2];
int cnt;
void dfs(int u, int p, int lev) {
  Lev[u] = lev;
  In[u] = ++cnt;
  for (auto v : adjList[u])
    if (v != p) dfs(v, u, !lev);
  Out[u] = cnt;
}
int main() {
  in(n, m);
  adjList.resize(n + 1);
  for (int i = 1; i <= n; i++) in(A[i]);
  for (int i = 0; i < n - 1; i++) {
    in(uu, vv);
    adjList[uu].push_back(vv);
    adjList[vv].push_back(uu);
  }
  dfs(1, -1, 0);
  int u, val;
  while (m--) {
    if (ReadInt() & 1) {
      in(u, val);
      fn[Lev[u]].upd(In[u], Out[u], val);
      fn[!Lev[u]].upd(In[u], Out[u], -val);
    } else {
      in(u);
      out(fn[Lev[u]].qry(In[u]) + A[u]);
      putc('\n', stdout);
    }
  }
}
