Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of the tree is node 1.

This tree has a special property: when a value val is added to a value of node i, the value -val is added to values of all the children of node i. Note that when you add value -val to a child of node i, you also add -(-val) to all children of the child of node i and so on. Look an example explanation to understand better how it works.

This tree supports two types of queries:

  * "1 x val" — val is added to the value of node x; 
  * "2 x" — print the current value of node x. 



In order to help Iahub understand the tree better, you must answer m queries of the preceding type.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 200000). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000). Each of the next n–1 lines contains two integers vi and ui (1 ≤ vi, ui ≤ n), meaning that there is an edge between nodes vi and ui.

Each of the next m lines contains a query in the format described above. It is guaranteed that the following constraints hold for all queries: 1 ≤ x ≤ n, 1 ≤ val ≤ 1000.

Output

For each query of type two (print the value of node x) you must print the answer to the query on a separate line. The queries must be answered in the order given in the input.

Examples

Input

5 5
1 2 1 1 2
1 2
1 3
2 4
2 5
1 2 3
1 1 2
2 1
2 2
2 4


Output

3
3
0

Note

The values of the nodes are [1, 2, 1, 1, 2] at the beginning.

Then value 3 is added to node 2. It propagates and value -3 is added to it's sons, node 4 and node 5. Then it cannot propagate any more. So the values of the nodes are [1, 5, 1, - 2, - 1].

Then value 2 is added to node 1. It propagates and value -2 is added to it's sons, node 2 and node 3. From node 2 it propagates again, adding value 2 to it's sons, node 4 and node 5. Node 3 has no sons, so it cannot propagate from there. The values of the nodes are [3, 3, - 1, 0, 1].

You can see all the definitions about the tree at the following link: http://en.wikipedia.org/wiki/Tree_(graph_theory)
#include <bits/stdc++.h>
struct edge {
  int to, next;
} e[200010 << 1];
int a[200010], head[200010], st[200010], ed[200010], rid[200010], dep[200010];
int n, m, dfn = 0, cnt = 1;
inline void ins(int x, int y) {
  e[++cnt].to = y;
  e[cnt].next = head[x];
  head[x] = cnt;
}
void dfs(int x, int f) {
  st[x] = ++dfn;
  rid[dfn] = x;
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to != f) {
      dep[e[i].to] = dep[x] + 1;
      dfs(e[i].to, x);
    }
  ed[x] = dfn;
}
struct segtree {
  int l, r, tag, fh;
} t[200010 << 2];
void build(int p, int l, int r) {
  t[p].l = l;
  t[p].r = r;
  t[p].tag = 0;
  if (l != r) {
    int mid = (l + r) >> 1;
    build(p << 1, l, mid);
    build(p << 1 | 1, mid + 1, r);
  }
}
void change(int p, int l, int r, int val) {
  if (l <= t[p].l && t[p].r <= r) {
    t[p].tag += val;
    return;
  }
  int mid = (t[p].l + t[p].r) >> 1;
  if (l <= mid) change(p << 1, l, r, val);
  if (mid + 1 <= r) change(p << 1 | 1, l, r, val);
}
inline void pushdown(int p) {
  t[p << 1].tag += t[p].tag;
  t[p << 1 | 1].tag += t[p].tag;
  t[p].tag = 0;
}
int query(int p, int x) {
  if (t[p].l == t[p].r)
    return a[rid[t[p].l]] + t[p].tag * ((dep[rid[t[p].l]] & 1) ? 1 : (-1));
  pushdown(p);
  int mid = (t[p].l + t[p].r) >> 1;
  if (x <= mid)
    return query(p << 1, x);
  else
    return query(p << 1 | 1, x);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    ins(x, y);
    ins(y, x);
  }
  dep[1] = 1;
  dfs(1, 1);
  build(1, 1, n);
  for (int i = 1; i <= m; ++i) {
    int opt, x;
    scanf("%d%d", &opt, &x);
    if (opt == 1) {
      int val;
      scanf("%d", &val);
      val *= (dep[x] & 1) ? 1 : (-1);
      change(1, st[x], ed[x], val);
    } else
      printf("%d\n", query(1, st[x]));
  }
  return 0;
}
