#include "cstdio"

#include "cstring"

#include "vector"

#include "algorithm"

using namespace std;

#define maxn 100005

#define inf 0x3f3f3f3f

int head[maxn],qhead[maxn],lag[maxn],kth[maxn],tot1,tot2,f[maxn],vis[maxn],ancestor[maxn],p[maxn],s1[maxn],s2[maxn];

bool isUpdate[maxn];

struct Edge

{

    int to,next;

}e[maxn*];

struct Query

{

    int from,to,next,idx,c;

}q[maxn*];

void addedge(int u,int v)

{

    e[tot1].to=v;

    e[tot1].next=head[u];

    head[u]=tot1++;

}

void addquery(int u,int v,int idx,int c=inf)

{

    q[tot2].from=u;

    q[tot2].to=v;

    q[tot2].next=qhead[u];

    q[tot2].idx=idx;

    if(c!=inf) q[tot2].c=c;

    qhead[u]=tot2++;

}

int find(int x) {return x!=f[x]?f[x]=find(f[x]):x;}

void Union(int u,int v)

{

    u=find(u),v=find(v);

    if(u!=v) f[v]=u;

}

void LCA(int u)

{

    vis[u]=true;

    f[u]=u;

    for(int i=head[u];i!=-;i=e[i].next)

    {

        int v=e[i].to;

        if(!vis[v])

        {

            p[v]=u;

            LCA(v);

            Union(u,v);

        }

    }

    for(int i=qhead[u];i!=-;i=q[i].next)

    {

        int v=q[i].to;

        if(vis[v]) ancestor[q[i].idx]=find(v);

        //or storage e[i].lca=e[i^1].lca=find(v)

    }

}

int sum(int num)

{

    s2[]=s1[];

    int Max=s2[];

    for(int i=; i<num; i++)

    {

        if(s2[i-]>) s2[i]=s2[i-]+s1[i];

        else s2[i]=s1[i];

        if(s2[i]>Max) Max=s2[i];

    }

    return max(,Max);

}

int main()

{

    //freopen("in.txt","r",stdin);

    int T,n,m,u,v,c,cmd,qcnt=;

    scanf("%d",&n);

    tot1=tot2=;

    memset(head,-,sizeof(head));

    memset(qhead,-,sizeof(qhead));

    memset(vis,,sizeof(vis));

    memset(isUpdate,,sizeof(isUpdate));

    for(int i=;i<=n;i++) scanf("%d",&lag[i]);

    for(int i=; i<n-; i++)

    {

        scanf("%d%d",&u,&v);

        addedge(u,v);

        addedge(v,u);

    }

    scanf("%d",&m);

    for(int i=; i<m; i++)

    {

        scanf("%d",&cmd);

        if(cmd==)

        {

            scanf("%d%d%d",&u,&v,&c);

            addquery(u,v,i,c);

            addquery(v,u,i,c);

            isUpdate[i]=true;

        }

        else

        {

            scanf("%d%d",&u,&v);

            addquery(u,v,i);

            addquery(v,u,i);

        }

    }

    LCA();

    vector<int> ans;

    for(int i=; i<tot2; i=i+)

    {

        int u=q[i].from,v=q[i].to,idx=q[i].idx;

        int ed=ancestor[idx],cnt=;

        if(isUpdate[qcnt])

        {

            int c=q[i].c;

            while(u!=ed) lag[u]=c,u=p[u];

            lag[ed]=c;

            while(v!=ed) lag[v]=c,v=p[v];

        }

        else

        {

            while(u!=ed) s1[cnt++]=lag[u],u=p[u];

            s1[cnt++]=lag[ed];

            vector<int> rev;

            while(v!=ed) rev.push_back(lag[v]),v=p[v];

            for(int j=rev.size()-; j>=; j--) s1[cnt++]=rev[j];

            int x=sum(cnt);

            ans.push_back(x);

        }

        qcnt++;

    }

    for(int i=;i<ans.size()-;i++) printf("%d ",ans[i]);

    printf("%d\n",ans[ans.size()-]);

}