#include <bits/stdc++.h>
using namespace std;
const int N = 4e6 + 2;
int n, m;
list<int> graph[N];
int A[N] = {0};
bool depth[N] = {0};
int start[N], finish[N];
int bit[N] = {0};
int timer = 0;
void dfs(int node, int parent) {
  start[node] = ++timer;
  for (auto i = graph[node].begin(); i != graph[node].end(); ++i) {
    int next = *i;
    if (next != parent) {
      depth[next] = depth[node] ^ 1;
      dfs(next, node);
    }
  }
  finish[node] = timer;
}
inline int query(int index) {
  int value = 0;
  while (index) {
    value += bit[index];
    index = index & (index - 1);
  }
  return value;
}
inline void update(int index, int value) {
  while (index <= timer) {
    bit[index] += value;
    index += index & (-index);
  }
}
int main(void) {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", A + i);
  }
  int a, b;
  for (int i = 1; i < n; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  dfs(1, -1);
  while (m--) {
    int type;
    scanf("%d ", &type);
    if (type == 1) {
      int node, val;
      scanf("%d%d ", &node, &val);
      if (depth[node]) {
        update(finish[node] + 1, val);
        update(start[node], -val);
      } else {
        update(start[node], val);
        update(finish[node] + 1, -val);
      }
    } else {
      int node;
      scanf("%d", &node);
      if (depth[node]) {
        printf("%d\n", A[node] - query(start[node]));
      } else {
        printf("%d\n", A[node] + query(start[node]));
      }
    }
  }
}
