#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int mx = 2e5 + 5;
const int INF = 1000000007;
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y >>= 1;
    x = (x * x) % 1000000007;
  }
  return (res % 1000000007);
}
class BIT {
  vector<long long> bit;
  long long N;

 public:
  void update(long long x, long long val) {
    long long ind = x;
    while (ind <= N) {
      bit[ind] += val;
      ind += ((ind) & (-ind));
    }
  }
  BIT(long long n) {
    N = mx;
    bit = vector<long long>(N, 0);
  }
  long long getSum(long long x) {
    if (x < 0) return 0;
    long long ind = x;
    long long sum = 0;
    while (ind > 0) {
      sum += bit[ind];
      ind -= ((ind) & (-ind));
    }
    return sum;
  }
  long long getValue(long long x) { return getSum(x) - getSum(x - 1); }
  void changeElem(long long x, long long val) {
    update(x + 1, val - getValue(x));
  }
};
vector<long long> adj[mx];
vector<long long> in, out;
long long timer = 0;
vector<long long> depth;
void dfs(long long curr, long long par, long long d) {
  in[curr] = ++timer;
  depth[curr] = d;
  for (auto child : adj[curr]) {
    if (child != par) {
      dfs(child, curr, d + 1);
    }
  }
  out[curr] = timer;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  in = vector<long long>(n + 10);
  out = vector<long long>(n + 10);
  depth = vector<long long>(n + 10);
  vector<long long> arr(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (int i = 1; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  dfs(1, 0, 0);
  BIT bit(n);
  while (m--) {
    long long op, x;
    cin >> op >> x;
    if (op == 1) {
      long long val;
      cin >> val;
      if (depth[x] & 1) val = -val;
      bit.update(in[x], val);
      bit.update(out[x] + 1, -val);
    } else {
      long long extra = bit.getSum(in[x]);
      if (depth[x] & 1) extra = -extra;
      cout << extra + arr[x] << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
}
