#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
void no() {
  cout << ("NO") << '\n';
  exit(0);
}
void yes() {
  cout << ("YES") << '\n';
  exit(0);
}
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);
VV G;
struct EulerTour {
  vector<int> tour;
  vector<int> L, R;
  EulerTour() {}
  EulerTour(int N) { initialize(N); }
  void initialize(int N) {
    L.resize(N);
    R.resize(N);
    dfs(0, -1);
  }
  void dfs(int i, int prev) {
    L[i] = tour.size();
    tour.push_back(i);
    for (int j : G[i]) {
      if (j == prev) continue;
      dfs(j, i);
      tour.push_back(i);
    }
    R[i] = tour.size() - 1;
  }
  void print() {
    for (ll a : tour) {
      cout << a << ' ';
    }
    cout << endl;
  }
};
struct BIT {
  VI data;
  BIT() {}
  BIT(ll sz) { resize(sz); }
  void resize(ll sz) { data.assign(++sz, 0); }
  ll sum(ll k) {
    ll ret = 0;
    for (++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }
  void add(ll k, ll x) {
    for (++k; k < (ll)data.size(); k += k & -k) data[k] += x;
  }
};
struct Range {
  BIT P, Q;
  Range(ll sz) {
    P.resize(sz + 1);
    Q.resize(sz + 1);
  }
  void update(ll a, ll b, ll w) {
    P.add(a, -w * a);
    P.add(b, w * b);
    Q.add(a, w);
    Q.add(b, -w);
  }
  ll simple_sum(ll c) { return P.sum(c) + Q.sum(c) * c; }
  ll sum(ll a, ll b) { return simple_sum(b) - simple_sum(a); }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll N, M;
  cin >> N >> M;
  VI A(N);
  for (ll i = (0); i < (N); ++i) {
    cin >> A.at(i);
  }
  G.resize(N);
  for (ll i = (0); i < (N - 1); ++i) {
    ll u, v;
    cin >> u >> v;
    u--;
    v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  auto tour = EulerTour(N);
  auto odd = Range(2 * N);
  auto even = Range(2 * N);
  for (ll i = (0); i < (N); ++i) {
    ll a = A[i];
    ll l = tour.L[i];
    if (l % 2 == 0) {
      even.update(l, l + 1, a);
    } else {
      odd.update(l, l + 1, a);
    }
  }
  while (M--) {
    ll type;
    cin >> type;
    if (type == 1) {
      ll x, val;
      cin >> x >> val;
      x--;
      ll i = tour.L[x];
      if (i % 2 == 0) {
        even.update(tour.L[x], tour.R[x] + 1, val);
        odd.update(tour.L[x], tour.R[x] + 1, -val);
      } else {
        even.update(tour.L[x], tour.R[x] + 1, -val);
        odd.update(tour.L[x], tour.R[x] + 1, val);
      }
    } else {
      ll x;
      cin >> x;
      x--;
      ll i = tour.L[x];
      ll ans;
      if (i % 2 == 0) {
        ans = even.sum(tour.L[x], tour.L[x] + 1);
      } else {
        ans = odd.sum(tour.L[x], tour.L[x] + 1);
      }
      cout << (ans) << '\n';
    }
  }
  return 0;
}
