#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = 1LL << 62;
const long long mx = 100005;
const double eps = 1e-10;
long long dx[10] = {1, 0, -1, 0};
long long dy[10] = {0, -1, 0, 1};
long long power(long long a, long long b) {
  if (b == 0) return 1;
  long long x = power(a, b / 2);
  x = x * x;
  if (b % 2) x = x * a;
  return x;
}
long long bigmod(long long a, long long b) {
  if (b == 0) return 1;
  long long x = bigmod(a, b / 2) % mod;
  x = (x * x) % mod;
  if (b % 2) x = (x * a) % mod;
  return x;
}
long long Set(long long N, long long pos) { return N = N | (1LL << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1LL << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1LL << pos)); }
vector<long long> graph[2 * mx];
long long arr[2 * mx], dis[2 * mx];
pair<long long, long long> pr[2 * mx];
long long mm[2 * mx], cnt;
void dfs(long long s, long long par, long long d) {
  mm[++cnt] = s;
  pr[s].first = cnt;
  dis[s] = d % 2;
  for (long long i = 0; i < (long long)(graph[s]).size(); i++) {
    long long v = graph[s][i];
    if (v == par) continue;
    dfs(v, s, dis[s] + 1);
  }
  pr[s].second = cnt;
}
long long odd[8 * mx], even[8 * mx];
void propagate(long long at, long long L, long long R) {
  long long mid = (L + R) / 2;
  long long left_at = 2 * at, right_at = 2 * at + 1;
  long long left_L = L, left_R = mid, right_L = mid + 1, right_R = R;
  odd[left_at] += odd[at];
  odd[right_at] += odd[at];
  even[left_at] += even[at];
  even[right_at] += even[at];
  odd[at] = even[at] = 0;
}
void build(long long at, long long L, long long R) {
  if (L == R) {
    odd[at] = even[at] = 0;
    return;
  }
  long long mid = (L + R) / 2;
  build(2 * at, L, mid);
  build(2 * at + 1, mid + 1, R);
}
void update(long long at, long long L, long long R, long long l, long long r,
            long long val, long long d) {
  if (r < L || l > R) return;
  if (l <= L && r >= R) {
    if (d == 0) {
      even[at] += val;
      odd[at] -= val;
    } else {
      even[at] -= val;
      odd[at] += val;
    }
    return;
  }
  if (odd[at]) propagate(at, L, R);
  long long mid = (L + R) / 2;
  update(2 * at, L, mid, l, r, val, d);
  update(2 * at + 1, mid + 1, R, l, r, val, d);
}
long long query(long long at, long long L, long long R, long long l,
                long long r, long long d) {
  if (r < L || l > R) return 0;
  if (l <= L && r >= R) {
    if (d)
      return odd[at];
    else
      return even[at];
  }
  if (odd[at]) propagate(at, L, R);
  long long mid = (L + R) / 2;
  long long p = query(2 * at, L, mid, l, r, d);
  long long q = query(2 * at + 1, mid + 1, R, l, r, d);
  return p + q;
}
int main() {
  long long tst, a, b, c, k, n, m, res = 0, ans = 0, t = 0;
  scanf("%lld", &n), scanf("%lld", &m);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &arr[i]);
  }
  for (long long i = 1; i < n; i++) {
    scanf("%lld", &a), scanf("%lld", &b);
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  dfs(1, 0, 0);
  build(1, 1, cnt);
  for (long long i = 1; i <= m; i++) {
    scanf("%lld", &a);
    if (a == 1) {
      scanf("%lld", &b), scanf("%lld", &c);
      update(1, 1, cnt, pr[b].first, pr[b].second, c, dis[b]);
    } else {
      scanf("%lld", &b);
      res = query(1, 1, cnt, pr[b].first, pr[b].first, dis[b]);
      cout << res + arr[b] << "\n";
    }
  }
  return 0;
}
