// ROOT : DRAGON3012009 : WA in Real Life
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i = l ; i <= r ; i ++)
#define FORD(i,r,l) for(int i = r ; i >= l ; i --)
#define REP(i, a ) for(int i = 0 ; i < a ; i ++ )
#define compare(v) sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end());
#define ll long long
#define el "\n"
#define fi first
#define se second
#define _ROOT_ int main()
#define M 1000000007
#define MAXN 1000001
#define Bit(i) (1LL << i )
#define INF (1ll<<60)
#define NAME "file"
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;

ll n, m, q ;
ll a[MAXN] ;
ll st[MAXN], fin[MAXN], timeDFS ;
vector<ll> adj[MAXN ] ;

struct Seg {
    ll val[MAXN << 2 ] ;
    ll lazy[MAXN << 2 ] ;

    void fix(ll id, ll l, ll r ) {
        if(lazy[id]== 0 ) return ;
        val[id] += (lazy[id]) * (r - l + 1) ;
        if(l != r ) {
            lazy[id << 1] += lazy[id] ;
            lazy[id << 1 | 1 ] += lazy[id];
        }
        lazy[id] = 0 ;
    }

    void update(ll id, ll l,ll r, ll u, ll v, ll value ) {
        fix(id, l, r ) ;
        if(u > r || v < l ) return ;
        if(u <= l && v >= r ) {
            lazy[id] += value ;
            fix(id, l,r ) ;
            return ;
        }
        ll m = l + r >> 1 ;
        update(id << 1, l, m, u, v, value ) ;
        update(id << 1 | 1, m + 1, r, u, v, value ) ;
        val[id] = val[id << 1] + val[id << 1 | 1 ] ;
    }

    ll get(ll id, ll l, ll r, ll u, ll v ) {
        fix(id, l, r ) ;
        if(u > r || v < l ) return 0 ;
        if(u <=l && v >= r ) return val[id] ;
        ll m = l + r >> 1 ;
        return get(id << 1, l, m, u, v ) + get(id << 1 | 1, m  + 1, r, u, v ) ;
    }
} seg ;


void dfs(ll u, ll p ) {
    st[u] = ++ timeDFS ;
    for(ll v : adj[u]) if(v != p ) {
            dfs(v, u ) ;
        }
    fin[u] = timeDFS ;
}

void init() {
    cin >> n >> q ;
    FOR(i, 1, n ) cin >> a[i] ;
    FOR(i, 2, n ) {
        ll x,  y ;
        cin >> x >> y ;
        adj[x].push_back(y) ;
        adj[y].push_back(x) ;
    }
}

void solve() {
    dfs(1 , 1 ) ;
    FOR(i, 1, n ) {
        seg.update(1, 1, n, st[i], st[i], a[i]);
    }
//    debug(seg.val[1]) ;
    FOR(cnt, 1, q ) {
        ll t, u, x ;
        cin >> t >> u ;
        if(t == 1 ) {
            cin >> x ;
            seg.update(1, 1, n, st[u], fin[u], x ) ;
        } else cout << seg.get(1, 1, n, st[u], fin[u]) << el ;
    }
}


_ROOT_ {
//    freopen(NAME".inp", "r", stdin);
//    freopen(NAME".out", "w", stdout) ;
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1; // cin >> t ;
    while(t--) {
        init();
        solve();
    }
    return (0&0);
}