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 MOD = 1e9 + 7;
const int maxn = 2e5 + 5;
int tin[maxn], tout[maxn];
int timer;
vector<int> vis;
vector<int> g[maxn];
int level[maxn];
void dfs(int s, int par) {
  int i;
  tin[s] = ++timer;
  vis.push_back(s);
  int l = g[s].size();
  if (s == 1)
    level[s] = 0;
  else
    level[s] = level[par] + 1;
  for (i = 0; i < l; i++) {
    if (g[s][i] != par) dfs(g[s][i], s);
  }
  tout[s] = timer;
}
int BIT[1000006];
long long sum(int idx) {
  if (idx == 0) return 0;
  int res = 0;
  while (idx > 0) {
    res += (long long)BIT[idx];
    idx -= (idx & -idx);
  }
  return res;
}
void update(int idx, int val) {
  while (idx < 1000006) {
    BIT[idx] += val;
    idx += idx & -idx;
  }
}
long long value[maxn];
int main() {
  int n, t, m, l, k, ans, i, j, res = 0, fl;
  t = 1;
  int q, x, y;
  while (t--) {
    scanf("%d", &n);
    scanf("%d", &q);
    for (i = 1; i <= n; i++) cin >> value[i];
    for (i = 0; i < n - 1; i++) {
      scanf("%d", &x);
      scanf("%d", &y);
      g[x].push_back(y);
      g[y].push_back(x);
    }
    vis.push_back(0);
    timer = 0;
    dfs(1, -1);
    int ct = 1;
    while (q--) {
      scanf("%d", &x);
      if (x == 2) {
        int idx;
        scanf("%d", &idx);
        int right = tout[idx];
        int left = tin[idx];
        if (level[idx] % 2 == 0)
          cout << value[idx] + sum(left) << endl;
        else
          cout << value[idx] - sum(left) << endl;
      } else {
        scanf("%d", &x);
        scanf("%d", &y);
        int left = tin[x];
        int right = tout[x];
        if (level[x] % 2 == 0) {
          update(left, y);
          update(right + 1, -y);
        } else {
          update(left, -y);
          update(right + 1, y);
        }
      }
    }
  }
  return 0;
}
