#include<stdio.h>
#include<algorithm>
#include<vector>
#define pb push_back
#define maxn 16005
#define maxlg 20
using namespace std;

int n,m,nre,nrl;
int rmq[maxlg][maxn<<2],lg[maxn<<2],euler[maxn<<2],epos[maxn],lev[maxn];
int liniar[maxn<<1],lpos_first[maxn],lpos_last[maxn];
int aib[maxn<<1],t[maxn];
vector <int> l[maxn];

void read()
{
    int x,y;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&t[i]);
    for(int i=1;i<n;i++)
    {
        scanf("%d%d",&x,&y);
        l[x].pb(y); l[y].pb(x);
    }
}

void dfs(int k,int level)
{
    lev[k]=level;
    euler[++nre]=k; epos[k]=nre;
    liniar[++nrl]=t[k]; lpos_first[k]=nrl;
    for(unsigned int i=0;i<l[k].size();i++)
     if(!lev[l[k][i]])
     {
         dfs(l[k][i],level+1);
         euler[++nre]=k;
     }
    liniar[++nrl]=-t[k]; lpos_last[k]=nrl;
}

void RMQ()
{
    int i,j;
    for(i=1;i<=nre;i++) rmq[0][i]=euler[i];
    for(i=2;i<=nre;i++) lg[i]=lg[i>>1]+1;

    for(i=1;(1<<i)<=nre;i++)
     for(j=1;j+(1<<i)-1<=nre;j++)
     {
        rmq[i][j]=rmq[i-1][j+(1<<(i-1))];
        if(lev[rmq[i-1][j]]<lev[rmq[i][j]]) rmq[i][j]=rmq[i-1][j];
     }
}

int LCA(int x,int y)
{
    if(epos[x]>epos[y]) swap(x,y);

    int ex=epos[x],ey=epos[y],k=lg[ey-ex+1];
    int node=rmq[k][ey-(1<<k)+1];
    if(lev[rmq[k][ex]]<lev[rmq[k][ey-(1<<k)+1]]) node=rmq[k][ex];
    return node;
}

void update(int k,int val)
{
    int i=0;
    while(k<=nrl)
    {
        aib[k]+=val;
        while( ((k>>i)&1)==0 ) i++;
        k+=(1<<i);
        i++;
    }
}

int query(int k)
{
    int sum=0,i=0;
    while(k>0)
    {
        sum+=aib[k];
        while( ((k>>i)&1)==0 ) i++;
        k-=(1<<i);
        i++;
    }
    return sum;
}

void solve()
{
    int i;
    int type,x,y,lval,node;
    int s,s1,s2;

    for(i=1;i<=nrl;i++) update(i,liniar[i]);
    scanf("%d",&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&type,&x,&y);
        if(type==1)
        {
            t[x]=y;
            lval=y-liniar[lpos_first[x]];
            update(lpos_first[x],lval);
            update(lpos_last[x],-lval);
            continue;
        }
        if(lpos_first[x]>lpos_first[y]) swap(x,y);
        node=LCA(x,y);
        if(node==x) printf("%d\n",query(lpos_first[y])-query(lpos_first[x]-1));
        else
        {
            s=query(lpos_first[node]-1);
            s1=query(lpos_first[x])-s;
            s2=query(lpos_first[y])-s-t[node];
            printf("%d\n",s1+s2);
        }
    }
}

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

    read();
    dfs(1,1);
    RMQ();
    solve();

    fclose(stdin);
    fclose(stdout);
    return 0;
}