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;
long long n, m, a[200010], p, q, bgn[200010], End[200010],
    tme = 0, op, x, val, rev[200010], bt[2][200010];
vector<long long> v[200010];
bool vis[200010] = {0}, lvl[200010];
void update(long long ft[], long long p, long long v) {
  for (; p <= n; p += p & (-p)) ft[p] += v;
}
long long query(long long ft[], long long b) {
  long long sum = 0;
  for (; b > 0; b -= b & (-b)) {
    sum += ft[b];
  }
  return sum + a[b];
}
void dfs(long long in, bool flag) {
  if (vis[in]) return;
  vis[in] = 1;
  long long sum = 1;
  bgn[in] = ++tme;
  rev[in] = tme;
  long long sz = v[in].size();
  lvl[in] = flag;
  for (long long i = 0; i < sz; i++) {
    dfs(v[in][i], !flag);
  }
  End[in] = tme;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 0; i < n - 1; i++) {
    cin >> p >> q;
    v[p].push_back(q);
    v[q].push_back(p);
  }
  dfs(1, 0);
  for (long long i = 1; i <= n; i++) {
    update(bt[lvl[i]], bgn[i], a[i]);
    update(bt[lvl[i]], bgn[i] + 1, -a[i]);
  }
  while (m--) {
    cin >> op;
    if (op == 1) {
      cin >> x >> val;
      update(bt[lvl[x]], bgn[x], val);
      update(bt[lvl[x]], End[x] + 1, -val);
      update(bt[!lvl[x]], bgn[x], -val);
      update(bt[!lvl[x]], End[x] + 1, val);
    } else if (op == 2) {
      cin >> x;
      cout << query(bt[lvl[x]], bgn[x]) << "\n";
    }
  }
  return 0;
}
