#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=2e5+10;
vector<int> vc[Maxn];
int father[Maxn];
int top[Maxn],son[Maxn],siz[Maxn],dep[Maxn];
int n,q;
ull a[Maxn];
inline void init(){
    cin>>n>>q;
    fr(i,1,n) cin>>a[i];
    fr(i,1,n-1){
        int x,y;
        cin>>x>>y;
        vc[x].pb(y);vc[y].pb(x);
    }
    fr(i,1,n-1){int x,y;cin>>x>>y;if(x>y) swap(x,y);assert((x+1)==y);}
}
inline void dfs(int x,int fa){
    dep[x]=dep[fa]+1;siz[x]=1;son[x]=0;father[x]=fa;
    for(auto y:vc[x]) if(y!=fa){
        dfs(y,x);
        if(!son[x] || siz[y]>siz[son[x]]) son[x]=y;
        siz[x]+=siz[y];
    }
}
inline void dfs1(int x,int fa,int tp){
    // cout<<"top:"<<x<<' '<<fa<<' '<<tp<<endl;
    top[x]=tp;
    if(son[x]) dfs1(son[x],x,tp);
    for(auto y:vc[x]) if(y!=fa && y!=son[x]) dfs1(y,x,y);
}
int TR;
namespace sgt{
    ull s[Maxn<<2];
    int minn[Maxn<<2],num[Maxn<<2];
    inline int ls(int x){return x<<1;}
    inline int rs(int x){return x<<1|1;}
    inline void pushup(int x){s[x]=s[ls(x)]+s[rs(x)];}
    inline void build(int x,int l,int r){
        if(l==r){s[x]=a[l];return;}
        int mid;mid=(l+r)>>1;
        build(ls(x),l,mid);build(rs(x),mid+1,r);
        pushup(x);
    }
    inline int getmin(int x,int y){if(dep[x]<dep[y]) return x;return y;}
    inline void prepare(int x,int l,int r){
        if(l==r){minn[x]=top[l];num[x]=1;return;}
        int mid;mid=(l+r)>>1;
        prepare(ls(x),l,mid);prepare(rs(x),mid+1,r);
        minn[x]=getmin(minn[ls(x)],minn[rs(x)]);num[x]=0;
        if(minn[ls(x)]==minn[x]) num[x]+=num[ls(x)];
        if(minn[rs(x)]==minn[x]) num[x]+=num[rs(x)];
        // cout<<"tree:"<<x<<' '<<l<<' '<<r<<' '<<minn[x]<<' '<<num[x]<<endl;
        return;
    }
    ull tag[Maxn<<2];
    inline void change(int x,ull k){s[x]+=k*num[x];tag[x]+=k;}
    inline void pushdown(int x){
        if(tag[x]){
            if(minn[x]==minn[ls(x)]) change(ls(x),tag[x]);
            if(minn[x]==minn[rs(x)]) change(rs(x),tag[x]);
            tag[x]=0;
        }
    }
    inline void update(int ql,int qr,int l,int r,int x,ull k){
        if(ql<=l && r<=qr){if(minn[x]==TR) change(x,k);return;}
        int mid;mid=(l+r)>>1;pushdown(x);
        if(ql<=mid) update(ql,qr,l,mid,ls(x),k);
        if(mid<qr) update(ql,qr,mid+1,r,rs(x),k);
        pushup(x);
    }
    inline void jia(int ql,int l,int r,int x,ull k){
        if(l==r){s[x]+=k;return;}
        int mid;mid=(l+r)>>1;pushdown(x);
        if(ql<=mid) jia(ql,l,mid,ls(x),k);
        else jia(ql,mid+1,r,rs(x),k);
        pushup(x);
    }
    inline ull query(int ql,int qr,int l,int r,int x){
        if(ql<=l && r<=qr) return s[x];
        int mid;mid=(l+r)>>1;pushdown(x);
        ull ans=0;
        if(ql<=mid) ans+=query(ql,qr,l,mid,ls(x));
        if(mid<qr) ans+=query(ql,qr,mid+1,r,rs(x));
        return ans;
    }
}
inline int getlca(int x,int y){
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        x=father[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);return x;
}
inline void change(int x,ull k){
    // int num=0;
    while(x){
        // cout<<"*"<<top[x]<<' '<<x<<endl;
        TR=top[x];
        sgt::update(top[x],x,1,n,1,k);
        x=father[top[x]];
        // ++num;
    }
    
    // cerr<<num<<endl;
}
inline void update(int x,int y,ull k){
    int llca=getlca(x,y);
    ull ans=0;
    // cout<<ans<<endl;
    // ull V=14172501950440445025ull;
    // fr(i,0,3000) if(ans+k*i==V){
    //     cout<<"*"<<i<<endl;
    // }
    // cout<<sgt::query(x,y,1,n,1)<<endl;
    change(x,k);
    // cout<<sgt::query(x,y,1,n,1)<<endl;
    change(y,k);
    // cout<<sgt::query(x,y,1,n,1)<<endl;
    // // cout<<dep[x]+dep[y]-2*dep[llca]+1<<endl;
    // // cout<<x<<' '<<y<<' '<<llca<<endl;
    sgt::jia(llca,1,n,1,k);
    // cout<<sgt::query(x,y,1,n,1)<<endl;
    change(llca,-2*k);
    // cout<<sgt::query(x,y,1,n,1)<<endl;
    return;
}
inline void query(int x,int y){
    cout<<sgt::query(x,y,1,n,1)<<'\n';
    return;
}
inline void work(){
    dfs(1,0);dfs1(1,0,1);
    sgt::build(1,1,n);sgt::prepare(1,1,n);
    while(q--){
        // cerr<<q<<endl;
        int x,y;ull k;
        cin>>x>>y>>k;
        if(x>y) swap(x,y);
        // cout<<x<<' '<<y<<' '<<getlca(x,y)<<' '<<k<<endl;
        update(x,y,k);query(x,y);
    }
}
signed main(){
    // return system("fc output.out output1.out");
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    cin.tie(0)->sync_with_stdio(0);
    init();work();
    // cerr<<(double)clock()/CLOCKS_PER_SEC<<endl;
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}