#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long int mod = 1000000007;
const long long int MAX = 100008;
vector<long long int> v[200005];
long long int in[200005];
long long int out[200005];
long long int arr[200005];
long long int value[200005];
long long int level[200005];
int vis[200005];
long long int timer = 0;
struct node {
  long long int odd, even;
};
void dfs(long long int node) {
  vis[node] = 1;
  timer++;
  in[node] = timer;
  arr[timer] = node;
  for (int i = 0; i < v[node].size(); i++) {
    if (vis[v[node][i]] == 0) {
      level[v[node][i]] = level[node] + 1;
      dfs(v[node][i]);
    }
  }
  out[node] = timer;
}
struct node lazy[900009];
void initialize() {
  for (int i = 0; i < 900009; i++) {
    lazy[i].odd = 0;
    lazy[i].even = 0;
  }
}
long long int ans = 0;
void query(long long int start, long long int end, long long int node,
           long long int idx, long long int lev) {
  long long int mid = (start + end) >> 1;
  if (lazy[node].even != 0 && lazy[node].odd != 0 && start != end) {
    lazy[2 * node].even += lazy[node].even;
    lazy[2 * node + 1].even += lazy[node].even;
    lazy[2 * node].odd += lazy[node].odd;
    lazy[2 * node + 1].odd += lazy[node].odd;
    lazy[node].even = 0;
    lazy[node].odd = 0;
  }
  if (start > idx || idx > end) {
    return;
  } else if (start == end && idx == end) {
    if (lev & 1)
      ans += lazy[node].odd;
    else
      ans += lazy[node].even;
  } else {
    query(start, mid, 2 * node, idx, lev);
    query(mid + 1, end, (2 * node) + 1, idx, lev);
  }
}
void update(long long int start, long long int end, long long int node,
            long long int l, long long int r, long long int val,
            long long int lev) {
  long long int mid = (start + end) >> 1;
  if (lazy[node].even != 0 && lazy[node].odd != 0 && start != end) {
    lazy[2 * node].even += lazy[node].even;
    lazy[2 * node + 1].even += lazy[node].even;
    lazy[2 * node].odd += lazy[node].odd;
    lazy[2 * node + 1].odd += lazy[node].odd;
    lazy[node].even = 0;
    lazy[node].odd = 0;
  }
  if (start > r || l > end) {
    return;
  } else if (l <= start && r >= end) {
    if (lev % 2 == 0) {
      lazy[node].even += val;
      lazy[node].odd -= val;
    } else {
      lazy[node].even -= val;
      lazy[node].odd += val;
    }
    return;
  } else {
    update(start, mid, 2 * node, l, r, val, lev);
    update(mid + 1, end, (2 * node) + 1, l, r, val, lev);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> value[i];
  for (int i = 1; i <= n - 1; i++) {
    long long int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  level[1] = 1;
  dfs(1);
  initialize();
  for (int i = 1; i <= n; i++) arr[in[i]] = value[i];
  while (q--) {
    int ch;
    cin >> ch;
    if (ch == 1) {
      long long int node, x;
      cin >> node >> x;
      long long int idx = in[node];
      update(1LL, n, 1LL, in[node], out[node], x, level[node]);
    } else {
      long long int node;
      cin >> node;
      ans = value[node];
      query(1, n, 1, in[node], level[node]);
      cout << ans << '\n';
    }
  }
}
