#include <bits/stdc++.h>
using namespace std;
vector<int> graph[4000005];
int arr[4000005], start[4000005], brr[4000005];
int tim = 1;
int a[4000005];
int seg[9000005];
int parity[4000005];
int below[4000005];
int lazy[9000005];
int build(int pos, int l, int r) {
  if (l == r) {
    seg[pos] = arr[l];
    return seg[pos];
  } else {
    int mid;
    mid = (l + r) >> 1;
    int a = build(2 * pos, l, mid);
    int c = build(2 * pos + 1, mid + 1, r);
    seg[pos] = a + c;
    return seg[pos];
  }
}
int parit(int l, int r, int value);
int query(int low, int high, int l, int r, int pos) {
  if (lazy[pos] != 0) {
    seg[pos] += lazy[pos];
    lazy[pos * 2] += lazy[pos];
    lazy[2 * pos + 1] += parit(l, (l + r) / 2 + 1, lazy[pos]);
    lazy[pos] = 0;
  }
  if (r < low || high < l) {
    return 0;
  } else if (low <= l && high >= r) {
    return seg[pos];
  } else {
    int mid = (l + r) >> 1;
    int a = query(low, high, l, mid, 2 * pos);
    int c = query(low, high, mid + 1, r, 2 * pos + 1);
    return a + c;
  }
}
void update(int low, int high, int l, int r, int value, int pos) {
  if (r < low || high < l) {
    if (lazy[pos] != 0) {
      seg[pos] += lazy[pos];
      lazy[pos * 2] += parit(l, l, lazy[pos]);
      lazy[pos * 2 + 1] += parit(l, (l + r) / 2 + 1, lazy[pos]);
      lazy[pos] = 0;
    }
    return;
  } else if (low <= l && high >= r) {
    if (lazy[pos] == 0) {
      seg[pos] += parit(low, l, value);
      lazy[pos * 2] += parit(low, l, value);
      lazy[pos * 2 + 1] += parit(low, (l + r) / 2 + 1, value);
    } else {
      seg[pos] += lazy[pos];
      seg[pos] += parit(low, l, value);
      lazy[pos * 2] += parit(l, l, lazy[pos]) + parit(low, l, value);
      lazy[pos * 2 + 1] += parit(l, (l + r) / 2 + 1, lazy[pos]) +
                           parit(low, (l + r) / 2 + 1, value);
      lazy[pos] = 0;
    }
    return;
  } else {
    if (lazy[pos] != 0) {
      seg[pos] += lazy[pos];
      lazy[pos * 2] += parit(l, l, lazy[pos]);
      lazy[pos * 2 + 1] += parit(l, (l + r) / 2 + 1, lazy[pos]);
      lazy[pos] = 0;
    }
    int mid = (l + r) >> 1;
    update(low, high, l, mid, value, 2 * pos);
    update(low, high, mid + 1, r, value, 2 * pos + 1);
  }
}
int parit(int l, int r, int value) {
  if (parity[l] == parity[r]) {
    return value;
  } else {
    int min;
    min = (-1) * value;
    return min;
  }
}
void dfs(int u, int pre) {
  if (brr[u] == 0) {
    start[u] = tim;
    arr[tim] = a[u];
    parity[tim] = !pre;
    pre = !pre;
    tim++;
    brr[u] = 1;
    for (int i = 0; i < graph[u].size(); i++) {
      dfs(graph[u][i], pre);
    }
    below[u] = tim - 1;
    brr[u] = 2;
  }
}
int main() {
  int m, n, u, v, w;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d %d", &u, &v);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  dfs(1, 0);
  build(1, 1, n);
  for (int i = 0; i < m; i++) {
    scanf("%d", &u);
    if (u == 1) {
      scanf("%d %d", &u, &v);
      update(start[u], below[u], 1, n, v, 1);
    } else {
      scanf("%d", &u);
      printf("%d\n", query(start[u], start[u], 1, n, 1));
    }
  }
}
