#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
clock_t tStart = clock();
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 2e5 + 5;
int n, m;
int a[mx];
vector<int> adjlist[mx];
int b[mx], c[mx], d[mx];
int nxt = 1;
int tree[mx * 4];
void dfs(int u, int par, int ok) {
  int ret = 1;
  int l = adjlist[u].size();
  for (int i = 0; i < l; ++i) {
    int v = adjlist[u][i];
    if (v == par) continue;
    dfs(v, u, ((ok == 1) ? -1 : 1));
    ret += d[v];
  }
  c[u] = nxt;
  b[nxt++] = ok;
  d[u] = ret;
}
void shift(int node) {
  tree[2 * node] += tree[node];
  tree[2 * node + 1] += tree[node];
  tree[node] = 0;
}
void update(int node, int l, int r, int bb, int e, int x) {
  if (l > e || r < bb) return;
  if (l >= bb && r <= e) {
    tree[node] += ((b[e] == 1) ? x : -x);
    return;
  }
  shift(node);
  int mid = (l + r) / 2;
  update(2 * node, l, mid, bb, e, x);
  update(2 * node + 1, mid + 1, r, bb, e, x);
}
int query(int node, int l, int r, int b, int e) {
  if (l > e || r < b) return 0;
  if (l >= b && r <= e) return tree[node];
  shift(node);
  int mid = (l + r) / 2;
  int p1 = query(2 * node, l, mid, b, e);
  int p2 = query(2 * node + 1, mid + 1, r, b, e);
  return (p1 + p2);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 0, u, v; i < n - 1; ++i) {
    cin >> u >> v;
    adjlist[u].emplace_back(v);
    adjlist[v].emplace_back(u);
  }
  dfs(1, 0, 1);
  for (int i = 0; i < m; ++i) {
    int t, x, val;
    cin >> t;
    if (t == 1) {
      cin >> x >> val;
      update(1, 1, n, c[x] - d[x] + 1, c[x], val);
    } else {
      cin >> x;
      long long p = query(1, 1, n, c[x], c[x]);
      cout << a[x] + ((b[c[x]] == 1) ? p : -p) << '\n';
    }
  }
}
