#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
const long long int N = 2e5 + 10, N2 = 2e5 + 10, delta = 46639, mod = 1e9 + 7,
                    oo = N - 1, LOG = 20;
const long double PI = 3.141592653589793;
long long int sum[N << 2], cnt, st[N], fn[N], h[N], a[N];
vector<long long int> v[N];
void dfs(long long int x, long long int par) {
  st[x] = cnt++;
  for (auto u : v[x])
    if (u != par) {
      h[u] = h[x] + 1;
      dfs(u, x);
    }
  fn[x] = cnt;
}
void add(long long int l, long long int r, long long int val,
         long long int b = 0, long long int e = N, long long int id = 1) {
  if (l <= b && e <= r) {
    sum[id] += val;
    return;
  }
  long long int mid = (b + e) / 2;
  if (l < mid) add(l, r, val, b, mid, 2 * id);
  if (mid < r) add(l, r, val, mid, e, 2 * id + 1);
}
long long int get1(long long int ind, long long int l = 0, long long int r = N,
                   long long int id = 1) {
  if (r - l <= 1) return sum[id];
  long long int mid = (r + l) / 2, ans = sum[id];
  if (ind < mid)
    ans += get1(ind, l, mid, 2 * id);
  else
    ans += get1(ind, mid, r, 2 * id + 1);
  return ans;
}
long long int get2(long long int ind, long long int l = 0, long long int r = N,
                   long long int id = 1) {
  if (r - l <= 1) return -sum[id];
  long long int mid = (r + l) / 2, ans = -sum[id];
  if (ind < mid)
    ans += get2(ind, l, mid, 2 * id);
  else
    ans += get2(ind, mid, r, 2 * id + 1);
  return ans;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long int n, q;
  cin >> n >> q;
  for (long long int i = 0; i < n; i++) cin >> a[i];
  for (long long int i = 0; i < n - 1; i++) {
    long long int x, y;
    cin >> x >> y;
    x--, y--;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(0, -1);
  while (q--) {
    long long int type;
    cin >> type;
    if (type == 1) {
      long long int u, val;
      cin >> u >> val;
      u--;
      if (!(h[u] % 2))
        add(st[u], fn[u], val);
      else
        add(st[u], fn[u], -val);
    } else {
      long long int u;
      cin >> u;
      u--;
      if (!(h[u] % 2))
        cout << a[u] + get1(st[u]) << '\n';
      else
        cout << a[u] + get2(st[u]) << '\n';
    }
  }
  return 0;
}
