#include <bits/stdc++.h>
using namespace std;
const int NMAX = 200010;
int N, M, Type, Val, X, Y, A[NMAX], AibOdd[2 * NMAX], AibEven[2 * NMAX],
    Level[NMAX], First[NMAX], Last[NMAX], K;
vector<int> G[NMAX];
bool Used[NMAX];
void DFS(int Node, int Father) {
  Used[Node] = 1;
  Level[Node] = Level[Father] + 1;
  First[Node] = ++K;
  for (int i = 0; i < G[Node].size(); ++i)
    if (!Used[G[Node][i]]) DFS(G[Node][i], Node);
  Last[Node] = ++K;
}
int LSB(int X) { return (X & (X - 1)) ^ X; }
void Update(int Aib[NMAX], int Pos, int Val) {
  for (; Pos <= 2 * N; Pos += LSB(Pos)) Aib[Pos] += Val;
}
int Query(int Aib[NMAX], int Pos) {
  int Ans = 0;
  for (; Pos; Pos -= LSB(Pos)) Ans += Aib[Pos];
  return Ans;
}
int main() {
  scanf("%i %i", &N, &M);
  for (int i = 1; i <= N; ++i) scanf("%i", &A[i]);
  for (int i = 1; i < N; ++i) {
    scanf("%i %i", &X, &Y);
    G[X].push_back(Y);
    G[Y].push_back(X);
  }
  DFS(1, 0);
  for (; M; M--) {
    scanf("%i", &Type);
    if (Type == 1) {
      scanf("%i %i", &X, &Val);
      if (Level[X] % 2 == 0) {
        Update(AibEven, First[X], Val);
        Update(AibEven, Last[X], -Val);
      } else {
        Update(AibOdd, First[X], Val);
        Update(AibOdd, Last[X], -Val);
      }
    } else {
      scanf("%i", &X);
      if (Level[X] % 2 == 0)
        printf("%i\n",
               A[X] + Query(AibEven, First[X]) - Query(AibOdd, First[X]));
      else
        printf("%i\n",
               A[X] + Query(AibOdd, First[X]) - Query(AibEven, First[X]));
    }
  }
}
