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;
vector<int> w[200020];
int a, b, ar[200020], bas[200020], son[200020], tmp, tek[200020], ger[200020],
    ters[200020], segment[200020 * 5][2];
void dfs(int n, int der) {
  bas[n] = ++tmp;
  tek[n] = der % 2;
  for (int i = 0; i < w[n].size(); i++)
    if (!bas[w[n][i]]) dfs(w[n][i], der + 1);
  son[n] = tmp;
}
bool cmp(int a, int b) { return bas[a] < bas[b]; }
void update(int k, int b, int s, int x, int y, int m, int e) {
  if (x <= b && s <= y) {
    segment[k][e] += m;
    return;
  }
  if (x > s || b > y) return;
  update(2 * k, b, (b + s) / 2, x, y, m, e);
  update(2 * k + 1, (b + s) / 2 + 1, s, x, y, m, e);
}
int find(int k, int b, int s, int x) {
  int top = (segment[k][0] - segment[k][1]) * (tek[ger[x]] ? -1 : 1);
  if (b == s && s == x) return ar[ger[x]] + top;
  if (b > x || s < x) return 0;
  if (x <= (b + s) / 2)
    return find(2 * k, b, (b + s) / 2, x) + top;
  else
    return find(2 * k + 1, (b + s) / 2 + 1, s, x) + top;
}
int main() {
  scanf("%d %d", &a, &b);
  for (int i = 1; i <= a; i++) scanf("%d", &ar[i]);
  for (int i = 1; i < a; i++) {
    int j, k;
    scanf("%d %d", &j, &k);
    w[j].push_back(k);
    w[k].push_back(j);
  }
  dfs(1, 1);
  for (int i = 1; i <= a; i++) ger[i] = i;
  sort(ger + 1, ger + 1 + a, cmp);
  for (int i = 1; i <= a; i++) ters[ger[i]] = i;
  for (int i = 1; i <= b; i++) {
    int t, e, r;
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d %d", &e, &r);
      update(1, 1, a, bas[e], son[e], r, tek[e] % 2);
    }
    if (t == 2) {
      scanf("%d", &e);
      printf("%d\n", find(1, 1, a, ters[e]));
    }
  }
  return 0;
}
