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;
inline int rei() {
  int x;
  cin >> x;
  return x;
}
inline long long rel() {
  long long x;
  cin >> x;
  return x;
}
inline string res() {
  string x;
  cin >> x;
  return x;
}
class Monoid {
 public:
  using t = int;
  static t id() { return 0; }
  static t op(const t& l, const t& r) { return l + r; }
};
template <typename M>
class SegmentTree {
  using T = typename M::t;
  const int n;
  vector<T> data;
  int size(int n_) {
    int res = 1;
    while (res < n_) {
      res <<= 1;
    }
    return res;
  }

 public:
  SegmentTree(int n_) : n(size(n_)), data(n * 2, M::id()) {}
  SegmentTree(int n_, T v) : n(size(n_)), data(n * 2, v) {}
  SegmentTree(const vector<T>& data_)
      : n(size(data_.size())), data(n * 2, M::id()) {
    init(data_);
  }
  void init() {
    for (int i = n - 1; i >= 1; i--)
      data[i] = M::op(data[i * 2], data[i * 2 + 1]);
  }
  void init(const vector<T>& data_) {
    for (int i = 0; i < (int)data_.size(); i++) data[i + n] = data_[i];
    init();
  }
  T Query(int k) {
    k += n;
    T ans = data[k];
    while (k >>= 1) {
      ans = M::op(ans, data[k]);
    }
    return ans;
  }
  void Update(int a, int b, const T x) {
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) data[a] = M::op(data[a], x), a++;
      if (b & 1) b--, data[b] = M::op(data[b], x);
    }
  }
};
bool Depth[200000];
int A[200000];
int childt[200000];
int vtoo[200000];
vector<int> G[200000];
void Calc() {
  int N = rei();
  int M = rei();
  for (int i = 0; i < N; i++) {
    A[i] = rei();
  }
  for (int i = 0; i < N - 1; i++) {
    int f = rei() - 1;
    int t = rei() - 1;
    G[f].push_back(t);
    G[t].push_back(f);
  }
  stack<pair<int, int>> sp;
  int c = 0;
  sp.push({0, -1});
  while (!sp.empty()) {
    int v = sp.top().first;
    int f = sp.top().second;
    sp.pop();
    if (v >= N) {
      v -= N;
      childt[v] = c;
    } else {
      if (f == -1) {
        Depth[v] = false;
      } else {
        Depth[v] = !Depth[f];
      }
      vtoo[v] = c;
      c++;
      sp.push({v + N, f});
      for (int i = 0; i < G[v].size(); i++) {
        int t = G[v][i];
        if (t != f) {
          sp.push({t, v});
        }
      }
    }
  }
  SegmentTree<Monoid> Seg(N);
  for (int i = 0; i < M; i++) {
    int type = rei();
    if (type == 1) {
      int x = rei() - 1;
      int val = rei();
      if (Depth[x]) {
        val = -val;
      }
      Seg.Update(vtoo[x], childt[x], val);
    } else {
      int x = rei() - 1;
      int ans = Seg.Query(vtoo[x]);
      if (Depth[x]) {
        ans = -ans;
      }
      ans += A[x];
      cout << ans << "\n";
    }
  }
}
int main(int argc, char** argv) {
  ios::sync_with_stdio(false), cin.tie(0);
  cout.tie(0);
  Calc();
  return 0;
}
