#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42,MX=14e6;

struct info
{
    int l,r;
    long long sum;
};
info tree[MX];

int POINTER_NEXT;

int get_node(int node)
{
    if(node>0)return node;

    node=POINTER_NEXT;
    POINTER_NEXT++;

    return node;
}

void update(int node,int l,int r,int pos,int val)
{
    //cout<<"update "<<node<<" "<<l<<" "<<r<<" "<<pos<<" "<<val<<endl;

    tree[node].sum+=val;

    if(l==r)return;

    int av=(l+r)/2;

    if(pos<=av)
    {
        tree[node].l=get_node(tree[node].l);

        update(tree[node].l,l,av,pos,val);
    }
    else
    {
        tree[node].r=get_node(tree[node].r);

        update(tree[node].r,av+1,r,pos,val);
    }
}
long long query(int node,int l,int r,int lq,int rq)
{
    //cout<<"query "<<node<<" "<<l<<" "<<r<<" "<<lq<<" "<<rq<<endl;

    if(node<=0)return 0;

    if(l==lq&&r==rq)return tree[node].sum;

    int av=(l+r)/2;

    long long ret=0;

    if(lq<=av)ret+=query(tree[node].l,l,av,lq,min(av,rq));
    if(av<rq)ret+=query(tree[node].r,av+1,r,max(av+1,lq),rq);

    return ret;
}

int n,q;

int inp[nmax];

struct edge
{
    int u,v,c;
};
edge edges[nmax];

bool cmp(edge a,edge b)
{
    if(a.c!=b.c)return a.c<b.c;

    return a.v>b.v;
}

vector< pair<int/*when*/,int/*delta*/> > updates[nmax];

long long sum[nmax];
int parent[nmax];

int root(int node)
{
    if(node==parent[node])return node;
    parent[node]=root(parent[node]);
    return parent[node];
}

void my_merge(int u,int v)
{
    u=root(u);
    v=root(v);


    if(updates[u].size()<updates[v].size())swap(u,v);

    //cout<<"my merge "<<u<<" "<<v<<endl;

    for(auto w:updates[v])
    {
        updates[u].push_back(w);

        //cout<<"add "<<u<<" "<<w.first<<" "<<w.second<<endl;

        update(u,1,q,w.first,w.second);
    }

    parent[v]=u;
    sum[u]+=sum[v];

    updates[v]={};
    updates[v].shrink_to_fit();
}

long long ask_value(int node,int t_now)
{
    node=root(node);

    //cout<<"ask value "<<node<<" "<<t_now<<endl;

    long long s=sum[node];

    long long t=query(node,1,q,1,t_now);

    //cout<<"s= "<<s<<" t= "<<t<<endl;

    return s+t;
}

long long outp[nmax];

bool PRINT[nmax];

void solve()
{
    scanf("%i%i",&n,&q);
    for(int i=1;i<=n;i++)scanf("%i",&inp[i]);

    for(int i=1;i<=n;i++)
    {
        parent[i]=i;
        sum[i]=inp[i];
    }

    int pointer=n-1;

    for(int i=1;i<=pointer;i++)scanf("%i%i%i",&edges[i].u,&edges[i].v,&edges[i].c);

    POINTER_NEXT=n+1;

    for(int i=1;i<=q;i++)
    {
        int type,node,val;

        scanf("%i%i%i",&type,&node,&val);
        if(type==2)
        {
            updates[node].push_back({i,val-inp[node]});
            update(node,1,q,i,val-inp[node]);

            inp[node]=val;
        }
        else
        {
            PRINT[i]=1;

            pointer++;
            edges[pointer].u=node;
            edges[pointer].v=-i;
            edges[pointer].c=val;
        }
    }

    sort(edges+1,edges+pointer+1,cmp);

    for(int i=1;i<=pointer;i++)
    {
        if(edges[i].v>0)my_merge(edges[i].u,edges[i].v);
        else
        {
            outp[-edges[i].v]=ask_value(edges[i].u,-edges[i].v);
        }
    }

    for(int i=1;i<=q;i++)
        if(PRINT[i])printf("%lld\n",outp[i]);
}

int main()
{

    freopen("thief.in","r",stdin);
    freopen("thief.out","w",stdout);

    int t=1;

    while(t)
    {
        t--;
        solve();
    }

    return 0;
}
/*
7 5
1 3 2 3 10 1 1
1 2 4
2 3 7
1 4 6
2 5 10
5 6 3
1 7 15
1 1 7
2 2 100
1 1 7
1 2 10
1 7 14

9
106
117
1
*/