#include <bits/stdc++.h>
using namespace std;
int t[2][500010];
int query(int id, int x) {
  int ret = 0;
  while (x > 0) {
    ret += t[id][x];
    x -= (x & (-x));
  }
  return ret;
}
void add(int id, int x, int val) {
  while (x <= 500010) {
    t[id][x] += val;
    x += (x & (-x));
  }
}
int arr[500010];
vector<int> v[500010];
int in[500010];
int out[500010];
int d[500010];
int curTime;
void f(int x, int pre) {
  in[x] = ++curTime;
  for (auto i : v[x]) {
    if (i != pre) {
      d[i] = d[x] + 1;
      f(i, x);
    }
  }
  out[x] = ++curTime;
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
  }
  int a, b;
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &a, &b);
    v[a].push_back(b);
    v[b].push_back(a);
  }
  f(1, -1);
  int ind;
  while (m--) {
    scanf("%d", &ind);
    if (ind == 1) {
      scanf("%d %d", &a, &b);
      add(d[a] % 2, in[a], b);
      add(d[a] % 2, out[a], -b);
      add((d[a] + 1) % 2, in[a], -b);
      add((d[a] + 1) % 2, out[a], b);
    } else {
      scanf("%d", &a);
      printf("%d\n", arr[a] + query(d[a] % 2, in[a]));
    }
  }
}
