#include <bits/stdc++.h>
using namespace std;
int start[200005], fin[200005], f[400005] = {0};
void update(int i, int x, int n) {
  while (i <= n) {
    f[i] += x;
    i += (i & (-i));
  }
}
long long int query(int i) {
  long long int ans = 0;
  while (i > 0) {
    ans += f[i];
    i = i & (i - 1);
  }
  return ans;
}
int vis[200005] = {0}, nodeOrd = 1;
void dfs(int node, vector<int> child[]) {
  vis[node] = 1;
  start[node] = nodeOrd;
  for (size_t j = 0; j < child[node].size(); j++) {
    if (vis[child[node][j]] == 0) {
      nodeOrd++;
      dfs(child[node][j], child);
      nodeOrd++;
    }
  }
  fin[node] = nodeOrd;
}
int main() {
  int n, m, u, v;
  scanf("%d%d", &n, &m);
  int a[n + 1];
  vector<int> child[n + 1];
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d", &u, &v);
    child[u].push_back(v);
    child[v].push_back(u);
  }
  dfs(1, child);
  int type;
  while (m--) {
    scanf("%d", &type);
    if (type == 1) {
      scanf("%d%d", &u, &v);
      if (start[u] % 2 == 1) v = -v;
      update(start[u], v, 2 * n + 3);
      update(fin[u] + 1, -v, 2 * n + 3);
    } else {
      scanf("%d", &u);
      int ans = query(start[u]);
      if (start[u] % 2 == 1) ans = -ans;
      printf("%d\n", a[u] + ans);
    }
  }
}
