// #define pragma

#ifdef pragma
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    cout << fixed << setprecision(10);
    #if _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 1e6 + 10;
const int INF = 1e15 + 7;
const int MAXLOG = 31;
const int MOD = 1e9 + 7;
const int BASE = 47;

matrix g;
vi odd, even, tin, tout, codd, ceven, a, isEven;
vector<pii> todd, teven;
int tt = 0;
int n, q;

void dfs(int u, int p, int dep) {
    if(dep % 2) {
        isEven[u] = 1;
        even.pb(u);
    }
    else {
        odd.pb(u);
    }
    tin[u] = tt++;
    for(auto v : g[u]) {
        if(v != p) {
            dfs(v, u, dep + 1);
        }
    }
    tout[u] = tt++;
}

void push_even(int v, int l, int r) {
    teven[v].x += teven[v].y * (r - l + 1);
    teven[v * 2 + 1].y += teven[v].y;
    teven[v * 2 + 2].y += teven[v].y;
    teven[v].y = 0;
}

int get_even(int v, int tl, int tr, int l, int r) {
    push_even(v, tl, tr);
    if(tl > r || tr < l) {
        return 0;
    }
    if(tl >= l && tr <= r) {
        return teven[v].x;
    }
    int tm = (tl + tr) >> 1;
    int left = get_even(v * 2 + 1, tl, tm, l, r);
    int right = get_even(v * 2 + 2, tm + 1, tr, l, r);
    return left + right;
}

void update_even(int v, int tl, int tr, int l, int r, int val) {
//    cerr << tl << " " << tr << '\n';
    push_even(v, tl, tr);
    if(tl > r || tr < l) {
        return;
    }
    if(tl >= l && tr <= r) {
//        cerr << tl << " " << tr << " " << val << '\n';
        teven[v].y += val;
        push_even(v, tl, tr);
        return;
    }
    int tm = (tl + tr) >> 1;
    update_even(v * 2 + 1, tl, tm, l, r, val);
    update_even(v * 2 + 2, tm + 1, tr, l, r, val);
    teven[v].x = teven[v * 2 + 1].x + teven[v * 2 + 2].x;
}



void push_odd(int v, int l, int r) {
    todd[v].x += todd[v].y * (r - l + 1);
    todd[v * 2 + 1].y += todd[v].y;
    todd[v * 2 + 2].y += todd[v].y;
    todd[v].y = 0;
}

int get_odd(int v, int tl, int tr, int l, int r) {
    push_odd(v, tl, tr);
    if(tl > r || tr < l) {
        return 0;
    }
    if(tl >= l && tr <= r) {
        return todd[v].x;
    }
    int tm = (tl + tr) >> 1;
    int left = get_odd(v * 2 + 1, tl, tm, l, r);
    int right = get_odd(v * 2 + 2, tm + 1, tr, l, r);
    return left + right;
}

void update_odd(int v, int tl, int tr, int l, int r, int val) {
    push_odd(v, tl, tr);
    if(tl > r || tr < l) {
        return;
    }
    if(tl >= l && tr <= r) {
        todd[v].y += val;
        push_odd(v, tl, tr);
        return;
    }
    int tm = (tl + tr) >> 1;
    update_odd(v * 2 + 1, tl, tm, l, r, val);
    update_odd(v * 2 + 2, tm + 1, tr, l, r, val);
    todd[v].x = todd[v * 2 + 1].x + todd[v * 2 + 2].x;
}

signed main() {
    seriy();
    cin >> n >> q;
    isEven.resize(n);
    todd.resize(8 * n);
    teven.resize(8 * n);
    tin.resize(n);
    tout.resize(n);
    g.resize(n);
    a.resize(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for(int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(0, -1, 0);
    vi wer(n);
    for(int i = 0; i < odd.size(); i++) {
        wer[odd[i]] = i;
        codd.pb(tin[odd[i]]);
    }
    for(int i = 0; i < even.size(); i++) {
        wer[even[i]] = i;
        ceven.pb(tin[even[i]]);
    }
//    sort(all(codd));
//    sort(all(ceven));
    for(int i = 0; i < even.size(); i++) {
        update_even(0, 0, n - 1, i, i, a[even[i]]);
    }
    for(int i = 0; i < odd.size(); i++) {
        update_odd(0, 0, n - 1, i, i, a[odd[i]]);
    }
    while(q--) {
        int t;
        cin >> t;
        if(t == 1) {
            int x, val;
            cin >> x >> val;
            x--;
            if(isEven[x]) {
                int left = lower_bound(all(ceven), tin[x]) - ceven.begin();
                int right = lower_bound(all(ceven), tout[x]) - ceven.begin() - 1;
//                assert(left <= right);
                update_even(0, 0, n - 1, left, right, val);
                left = lower_bound(all(codd), tin[x]) - codd.begin();
                right = lower_bound(all(codd), tout[x]) - codd.begin() - 1;
//                assert(left <= right);
                if(left != codd.size()) update_odd(0, 0, n - 1, left, right, -val);
            }
            else {
                int left = lower_bound(all(ceven), tin[x]) - ceven.begin();
                int right = lower_bound(all(ceven), tout[x]) - ceven.begin() - 1;
//                assert(left <= right);
//                cerr << left << " " << right << " " << -val << '\n';
                if(left != ceven.size()) update_even(0, 0, n - 1, left, right, -val);
                left = lower_bound(all(codd), tin[x]) - codd.begin();
                right = lower_bound(all(codd), tout[x]) - codd.begin() - 1;
//                assert(left <= right);
                update_odd(0, 0, n - 1, left, right, val);
            }
        }
        else {
            int x;
            cin >> x;
            x--;
            if(isEven[x]) {
                int pos = wer[x];
                cout << get_even(0, 0, n - 1, pos, pos) << '\n';
            }
            else {
                int pos = wer[x];
                cout << get_odd(0, 0, n - 1, pos, pos) << '\n';
            }
        }
    }
    return 0;
}