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 long long N = 2e5 + 14, inf = INT_MAX, Mod = 1e9 + 7;
long long n, m, p[N], a[N], id[N], fen[N][2], h[N];
vector<long long> v[N];
bool mark[N];
pair<long long, long long> tree[N];
void DFS() {
  long long now = 1;
  mark[1] = true;
  p[1] = -1;
  id[1] = 1;
  h[1] = 0;
  long long i = 2;
  while (now != -1) {
    bool fi = false;
    for (long long u : v[now]) {
      if (u != p[now] and !mark[u]) {
        h[i] = h[id[now]] + 1;
        p[u] = now;
        now = u;
        mark[u] = true;
        fi = true;
        id[now] = i;
        i++;
        break;
      }
    }
    if (!fi) {
      tree[now] = make_pair(id[now], i - 1);
      now = p[now];
    }
  }
}
void update(long long val, long long x, long long t) {
  while (x) {
    fen[x][t] += val;
    fen[x][1 - t] -= val;
    x = x - (x & (-1) * x);
  }
}
long long get(long long x, long long t) {
  long long ans = 0;
  while (x <= n) {
    ans += (fen[x][t]);
    x += (x & (-1) * x);
  }
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long i = 0; i < n - 1; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  DFS();
  for (long long i = 0; i < m; i++) {
    long long c, x;
    cin >> c >> x;
    if (c == 1) {
      long long val;
      cin >> val;
      update(val, tree[x].second, h[id[x]] % 2);
      val *= (-1);
      update(val, tree[x].first - 1, h[id[x]] % 2);
    } else {
      cout << get(id[x], h[id[x]] % 2) + a[x] << '\n';
    }
  }
}
