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>
using namespace std;
const int maxn = (int)(2e5) + 2;
const int mod = (int)(1e9) + 7;
int n, m, add[3][maxn * 3], timer, tin[maxn], t[3][maxn * 3], a[maxn],
    dep[maxn], d[maxn];
vector<int> g[maxn];
void dfs(int v, int p = 0) {
  tin[v] = ++timer;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (to == p) continue;
    dep[to] = 1 - dep[v];
    dfs(to, v);
    d[v] += d[to];
  }
}
void push(int k, int v) {
  if (add[k][v]) {
    add[k][v + v] += add[k][v];
    add[k][v + v + 1] += add[k][v];
    t[k][v + v] += add[k][v];
    t[k][v + v + 1] += add[k][v];
    add[k][v] = 0;
  }
}
int get(int k, int v, int tl, int tr, int pos) {
  if (tl == tr) return t[k][v];
  int tm = (tl + tr) >> 1;
  push(k, v);
  if (pos <= tm)
    return get(k, v + v, tl, tm, pos);
  else
    return get(k, v + v + 1, tm + 1, tr, pos);
}
void upd(int k, int v, int tl, int tr, int l, int r, int x) {
  if (l > tr || tl > r) return;
  if (l <= tl && tr <= r) {
    add[k][v] += x;
    t[k][v] += x;
    return;
  }
  push(k, v);
  int tm = (tl + tr) >> 1;
  upd(k, v + v, tl, tm, l, r, x);
  upd(k, v + v + 1, tm + 1, tr, l, r, x);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    d[i]++;
  }
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1);
  for (int i = 1; i <= n; i++) {
    upd(dep[i], 1, 1, n, tin[i], tin[i], a[i]);
  }
  for (int i = 1; i <= m; i++) {
    int type, x, val;
    cin >> type >> x;
    if (type == 1) {
      cin >> val;
      upd(dep[x], 1, 1, n, tin[x], tin[x] + d[x] - 1, val);
      upd(1 - dep[x], 1, 1, n, tin[x], tin[x] + d[x] - 1, -val);
    } else {
      cout << get(dep[x], 1, 1, n, tin[x]) << endl;
    }
  }
  return 0;
}
