#include<cstdio>

#include<iostream>

#include<cmath>

#define ll unsigned long long

#define R register ll

using namespace std;

const int N=;

inline ll g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

}

int n,m,q,T,cnt,num,rt;

int vr[N<<],nxt[N<<],a[N],fir[N],dfn[N],l[N],r[N],c[],t[N][],pos[N];

ll w[N],sum[];

inline void add(int u,int v) {vr[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

inline int lbt(int x) {return x&-x;}

inline void inc(int pos,ll d) {for(;pos<=n;pos+=lbt(pos)) w[pos]+=d;}

inline ll query(int pos) { R ret=;

    for(;pos;pos-=lbt(pos))

    ret+=w[pos]; return ret;

}

void dfs(int u) { l[u]=++num,++c[pos[u]]; inc(num,a[u]);

    for(R i=;i<=pos[n];++i) t[u][i]=c[i];

    for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(l[v]) continue; dfs(v);

    } r[u]=num,--c[pos[u]];

}

signed main() {

    n=g(),q=g(); T=sqrt(n); m=(n%T)?n/T+:n/T;

    for(R i=;i<=n;++i) a[i]=g(); for(R i=;i<=n;++i) pos[i]=(i-)/T+;

    for(R i=,u,v;i<=n;++i) {u=g(),v=g(); if(!u) rt=v; else add(u,v),add(v,u);}

    dfs(rt);

    for(R i=;i<=pos[n];++i) for(R j=(i-)*T+,lim=min(i*T,(ll)n);j<=lim;++j) sum[i]+=query(r[j])-query(l[j]-);

    for(R i=;i<=q;++i) {

        R k=g(),u=g(),v=g();

        if(k&) {

            inc(l[u],v-a[u]);

            for(R i=;i<=pos[n];++i) sum[i]+=1ull*t[u][i]*(v-a[u]);

            a[u]=v;

        } else { R ret=;

            if(pos[u]==pos[v]) for(R i=u;i<=v;++i) ret+=query(r[i])-query(l[i]-);

            else {

                for(R i=u;i<=pos[u]*T;++i) ret+=query(r[i])-query(l[i]-);

                for(R i=(pos[v]-)*T+;i<=v;++i) ret+=query(r[i])-query(l[i]-);

            } for(R i=pos[u]+;i<pos[v];++i) ret+=sum[i]; printf("%llu\n",ret);

        }

    }

}