#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define lnt long long
using namespace std;

char c;int x;
int readint()
{
	c=getchar();while(c<'0' || c>'9') c=getchar();
	x=0;while(c>'0' && c<'9') x=x*10+c-'0',c=getchar();return x;
}
const int up=30000+5;
int N,Q,fr,to,v[up],p[up];
vector<int> ve[up];
int de[up],tol[up][1005];
void change(int root,int t,int va)
{
    int now=t;
    while(now!=root)
    {
        tol[now][de[t]-de[now]]+=va-v[t];
        now=p[now];
    }
    v[t]=va;
}
void dfs(int dep,int u,int t)
{
    de[t]=dep;
    for(int i=ve[t].size()-1;i>=0;i--) dfs(dep+1,t,ve[t][i]);
    int now=t;
    while(now!=0)
    {
        tol[now][de[t]-de[now]]+=v[t];
        now=p[now];
    }
}

int main()
{
    freopen("newweapon.in","r",stdin);
    freopen("newweapon.out","w",stdout);

    int orz,m,n;

    N=readint();
    for(int i=1;i<=N;i++) v[i]=readint();
    for(int i=1;i<N;i++)
    {
        fr=readint(),to=readint();
        ve[fr].push_back(to);
        p[to]=fr;
    }
    dfs(0,0,1);
    Q=readint();
    for(int i=1;i<=Q;i++)
    {
        orz=readint(),m=readint(),n=readint();
        if(orz==1) change(0,m,n);
        else printf("%d\n",tol[m][n]);
    }

    return 0;
}