#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const double EPS = 1e-9, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using modint = ModInt<1000000007>;
template <typename T>
struct Combination {
  vector<T> _fact, _rfact, _inv;
  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for (int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for (int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for (int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }
  inline T fact(int k) const { return _fact[k]; }
  inline T rfact(int k) const { return _rfact[k]; }
  inline T inv(int k) const { return _inv[k]; }
  T P(int n, int r) const {
    if (r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }
  T C(int p, int q) const {
    if (q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
  T H(int n, int r) const {
    if (n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
vector<vector<int>> g(201010);
template <typename T>
struct LazySegmentTree {
  int n0;
  vector<T> node, lazy;
  LazySegmentTree(vector<T> &v) {
    int n = v.size();
    n0 = 1;
    while (n0 < n) n0 <<= 1;
    node.resize(2 * n0 - 1);
    lazy.assign(2 * n0 - 1, 0);
    for (int i = 0; i < n; i++) node[i + n0 - 1] = v[i];
    for (int i = n0 - 2; i >= 0; i--)
      node[i] = node[i * 2 + 1] + node[i * 2 + 2];
  }
  void eval(int k, int p) {
    if (lazy[k] == 0) return;
    node[k] += lazy[k] * p;
    if (k < n0 - 1) {
      lazy[k * 2 + 1] += lazy[k];
      lazy[k * 2 + 2] += lazy[k];
    }
    lazy[k] = 0;
  }
  void update(int a, int b, T x, int k, long long l, long long r) {
    eval(k, r - l);
    if (a <= l && r <= b) {
      lazy[k] += x;
      eval(k, r - l);
    } else if (a < r && l < b) {
      update(a, b, x, k * 2 + 1, l, (l + r) / 2);
      update(a, b, x, k * 2 + 2, (l + r) / 2, r);
      node[k] = node[k * 2 + 1] + node[k * 2 + 2];
    }
  }
  void update(int l, int r, T x) { update(l, r, x, 0, 0, n0); }
  T query(int a, int b, int k, long long l, long long r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return 0;
    else if (a <= l && r <= b) {
      return node[k];
    } else {
      T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
      T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
      return vl + vr;
    }
  }
  T query(int l, int r) { return query(l, r, 0, 0, n0); }
  inline T operator[](int a) { return query(a, a + 1); }
};
int in[201010], out[201010];
void euler_tour(int v, int p, int &k) {
  in[v] = k++;
  for (int u : g[v]) {
    if (u != p) {
      euler_tour(u, v, k);
      k++;
    }
  }
  out[v] = k;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for (int i = 0; i < (int)n; ++i) cin >> a[i];
  for (int i = 0; i < (int)n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  int k = 0;
  euler_tour(0, -1, k);
  vector<int> tmp(2 * n);
  LazySegmentTree<int> es(tmp), os(tmp);
  for (int i = 0; i < (int)n; ++i) {
    if (in[i] % 2 == 0)
      es.update(in[i], in[i] + 1, a[i]);
    else
      os.update(in[i], in[i] + 1, a[i]);
  }
  while (m--) {
    int type;
    cin >> type;
    if (type == 1) {
      int x, val;
      cin >> x >> val;
      x--;
      if (in[x] % 2 == 0) {
        es.update(in[x], out[x], val);
        os.update(in[x], out[x], -val);
      } else {
        es.update(in[x], out[x], -val);
        os.update(in[x], out[x], val);
      }
    } else {
      int x;
      cin >> x;
      x--;
      if (in[x] % 2 == 0) {
        cout << es[in[x]] << '\n';
      } else {
        cout << os[in[x]] << '\n';
      }
    }
  }
  return 0;
}
