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>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> dis(1, 1000);
const int N = 2e5 + 5;
vector<int> graph[N];
int tin[N], tout[N], tour[2 * N], dep[N];
int timer = 0;
int n, m, num[N];
void dfs(int u, int pr = 0) {
  tin[u] = ++timer;
  tour[timer] = u;
  for (int v : graph[u])
    if (v != pr) {
      dep[v] = dep[u] + 1;
      dfs(v, u);
    }
  tout[u] = timer;
}
template <class T>
struct Fenwick {
  vector<T> fenw;
  Fenwick(int n = 0) : fenw(n + 1, {}) {}
  void update(int i, T v) {
    for (; i < int(fenw.size()); i += (i & -i)) fenw[i] += v;
  }
  void update(int l, int r, T val) {
    update(l, val);
    update(r + 1, -val);
  }
  T query(int i) {
    T v = {};
    for (; i > 0; i -= (i & -i)) v += fenw[i];
    return v;
  }
};
int main() {
  cin.tie(0)->sync_with_stdio(0), cout.tie(0);
  cin >> n >> m;
  for (auto i = (1) - ((1) > (n + 1)); i != n + 1 - ((1) > (n + 1));
       i += 1 - 2 * ((1) > (n + 1)))
    cin >> num[i];
  for (auto i = (0) - ((0) > (n - 1)); i != n - 1 - ((0) > (n - 1));
       i += 1 - 2 * ((0) > (n - 1))) {
    int u, v;
    cin >> u >> v;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  dfs(1);
  Fenwick<int> tree(n);
  for (auto i = (0) - ((0) > (m)); i != m - ((0) > (m));
       i += 1 - 2 * ((0) > (m))) {
    int op, u, val;
    cin >> op >> u;
    if (op == 1) {
      cin >> val;
      tree.update(tin[u], tout[u], dep[u] % 2 == 0 ? +val : -val);
    } else
      cout << num[u] +
                  (dep[u] % 2 == 0 ? +tree.query(tin[u]) : -tree.query(tin[u]))
           << '\n';
  }
  return 0;
}
