#include <bits/stdc++.h>
using namespace std;
int node[400010], visited[400010], st[400010], en[400010], ti, ar[400010];
long long int odd[4 * 400010], even[4 * 400010];
vector<list<int> > adjlist(400010);
int read_int() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  int ret = 0;
  while (c >= '0' && c <= '9') {
    ret = 10 * ret + c - 48;
    c = getchar();
  }
  return ret;
}
void dfs(int i) {
  for (list<int>::iterator it = adjlist[i].begin(); it != adjlist[i].end();
       it++) {
    if (!visited[*it]) {
      visited[*it] = 1;
      st[*it] = ti;
      ar[ti] = node[*it];
      ti++;
      dfs(*it);
    }
  }
  en[i] = ti;
  ar[ti] = node[i];
  ti++;
}
void build(int low, int high, int pos) {
  if (low == high) {
    even[pos] = ar[low];
    odd[pos] = ar[low];
  } else {
    int mid = (low + high) / 2;
    build(low, mid, 2 * pos + 1);
    build(mid + 1, high, 2 * pos + 2);
    odd[pos] = 0;
    even[pos] = 0;
  }
}
long long int query(int qlow, int qhigh, int low, int high, int pos) {
  if (low != high) {
    odd[2 * pos + 1] += odd[pos];
    odd[2 * pos + 2] += odd[pos];
    odd[pos] = 0;
    even[2 * pos + 1] += even[pos];
    even[2 * pos + 2] += even[pos];
    even[pos] = 0;
  }
  if (qlow <= low && qhigh >= high) {
    if (low % 2 == 0) {
      return even[pos];
    } else {
      return odd[pos];
    }
  } else {
    int mid = (low + high) / 2;
    if (qlow > mid) {
      return query(qlow, qhigh, mid + 1, high, 2 * pos + 2);
    } else if (qhigh <= mid) {
      return query(qlow, qhigh, low, mid, 2 * pos + 1);
    }
  }
}
void eupdate(int qlow, int qhigh, int low, int high, int val, int pos) {
  if (low != high) {
    odd[2 * pos + 1] += odd[pos];
    odd[2 * pos + 2] += odd[pos];
    odd[pos] = 0;
    even[2 * pos + 1] += even[pos];
    even[2 * pos + 2] += even[pos];
    even[pos] = 0;
  }
  if (qlow <= low && qhigh >= high) {
    even[pos] += val;
  } else {
    int mid = (low + high) / 2;
    if (qlow > mid) {
      eupdate(qlow, qhigh, mid + 1, high, val, 2 * pos + 2);
    } else if (qhigh <= mid) {
      eupdate(qlow, qhigh, low, mid, val, 2 * pos + 1);
    } else {
      eupdate(qlow, qhigh, mid + 1, high, val, 2 * pos + 2);
      eupdate(qlow, qhigh, low, mid, val, 2 * pos + 1);
    }
  }
}
void oupdate(int qlow, int qhigh, int low, int high, int val, int pos) {
  if (low != high) {
    odd[2 * pos + 1] += odd[pos];
    odd[2 * pos + 2] += odd[pos];
    odd[pos] = 0;
    even[2 * pos + 1] += even[pos];
    even[2 * pos + 2] += even[pos];
    even[pos] = 0;
  }
  if (qlow <= low && qhigh >= high) {
    odd[pos] += val;
  } else {
    int mid = (low + high) / 2;
    if (qlow > mid) {
      oupdate(qlow, qhigh, mid + 1, high, val, 2 * pos + 2);
    } else if (qhigh <= mid) {
      oupdate(qlow, qhigh, low, mid, val, 2 * pos + 1);
    } else {
      oupdate(qlow, qhigh, mid + 1, high, val, 2 * pos + 2);
      oupdate(qlow, qhigh, low, mid, val, 2 * pos + 1);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  int n, m;
  n = read_int();
  m = read_int();
  for (int i = 1; i <= n; i++) {
    node[i] = read_int();
  }
  int i;
  for (i = 0; i < n - 1; i++) {
    int a, b;
    a = read_int();
    b = read_int();
    adjlist[a].push_back(b);
    adjlist[b].push_back(a);
  }
  visited[1] = 1;
  st[1] = ti;
  ar[ti] = node[1];
  ti++;
  dfs(1);
  build(0, ti - 1, 0);
  while (m--) {
    long long int a, b, c;
    a = read_int();
    if (a == 1) {
      b = read_int();
      c = read_int();
      if (st[b] % 2 == 0) {
        eupdate(st[b], en[b], 0, ti - 1, c, 0);
        oupdate(st[b], en[b], 0, ti - 1, (-1) * c, 0);
      } else {
        oupdate(st[b], en[b], 0, ti - 1, c, 0);
        eupdate(st[b], en[b], 0, ti - 1, (-1) * c, 0);
      }
    } else {
      b = read_int();
      printf("%d\n", query(st[b], st[b], 0, ti - 1, 0));
    }
  }
}
