#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,B=500;
int n,q;
ull a[Maxn];
int toid[Maxn];
struct sgt{
    ull s[Maxn<<2],tag[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 change(int x,int l,int r,ull k){s[x]+=(r-l+1)*k;tag[x]+=k;}
    inline void pushdown(int x,int l,int r){
        if(tag[x]){
            int mid;mid=(l+r)>>1;
            change(ls(x),l,mid,tag[x]);
            change(rs(x),mid+1,r,tag[x]);
            tag[x]=0;
        }
    }
    inline void update(int ql,int qr,int l,int r,int x,ull k){
        // cout<<ql<<' '<<qr<<' '<<l<<' '<<r<<' '<<x<<' '<<k<<endl;
        if(ql<=l && r<=qr) {change(x,l,r,k);return;}
        pushdown(x,l,r);int mid;mid=(l+r)>>1;
        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 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,l,r);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 void clear(int x,int l,int r){
        s[x]=tag[x]=0;
        if(l==r) return;
        int mid;mid=(l+r)>>1;
        clear(ls(x),l,mid);clear(rs(x),mid+1,r);
    }
}SGT;
struct BLOCK{
    ull S[Maxn],s[Maxn];
    int id[Maxn];
    int L[Maxn],R[Maxn];
    inline void into(){
        fr(i,1,n){
            id[i]=(i-1)/B+1;
            if(!L[id[i]]) L[id[i]]=i;
            R[id[i]]=i;
        }
        // fr(i,1,n){
        //     s[i]=a[toid[i]];
        //     if(i!=L[id[i]]) s[i]+=s[i-1];
        // }
        // fr(i,1,n) if(id[i]!=id[n]) S[id[i]+1]+=a[toid[i]];
        // fr(i,1,id[n]) S[i]+=S[i-1];
    }
    inline void update(int x,ull k){
        // cout<<x<<' '<<k<<endl;
        fr(i,x,R[id[x]]) s[i]+=k;
        fr(i,id[x]+1,id[n]) S[i]+=k;
    }
    inline ull getans(int x){return s[x]+S[id[x]];}
    inline ull query(int l,int r){if(l>r) return 0;return getans(r)-getans(l-1);}
}BL;
struct Tree{
    vector<int> vc[Maxn];
    int f[20][Maxn<<1],dep[Maxn];
    int dfn[Maxn],idx;
    int num,id[Maxn];
    int lg[Maxn<<1];
    int father[Maxn];
    int siz[Maxn];
    inline void dfs(int x,int fa){
        dep[x]=dep[fa]+1;f[0][++idx]=x;dfn[x]=idx;father[x]=fa;id[x]=++num;siz[x]=1;
        for(auto y:vc[x]) if(y!=fa){
            dfs(y,x);
            f[0][++idx]=x;siz[x]+=siz[y];
        }
    }
    inline int getmin(int x,int y){if(dep[x]<dep[y]) return x;return y;}
    inline int getlca(int x,int y){
        x=dfn[x],y=dfn[y];if(x>y) swap(x,y);
        int ln=lg[y-x+1];
        // cout<<ln<<' '<<x<<' '<<y<<' '<<f[ln][x]<<' '<<f[ln][y-(1<<ln)+1]<<endl;
        return getmin(f[ln][x],f[ln][y-(1<<ln)+1]);
    }
    inline void Read(){
        fr(i,1,n-1){
            int x,y;
            cin>>x>>y;
            vc[x].pb(y);vc[y].pb(x);
        }
        dfs(1,0);
        lg[0]=-1;fr(i,1,idx) lg[i]=lg[i/2]+1;
        fr(j,1,lg[idx]) fr(i,1,idx){
            if(i+(1<<j)-1>idx) break;
            f[j][i]=getmin(f[j-1][i],f[j-1][i+(1<<(j-1))]);
            // cout<<j<<' '<<i<<' '<<f[j][i]<<endl;
        }
    }
}T1,T2;
int vis[Maxn];
vector<int> ID;
struct node{int x,y;ull z;}que[Maxn];
ull ans[Maxn];
inline bool cmp(int a,int b){return T2.id[a]<T2.id[b];}
inline void init(){
    cin>>n>>q;
    fr(i,1,n) cin>>a[i];
    T1.Read();T2.Read();
    // fr(i,1,n) vis[i]=1;
    fr(i,1,n) SGT.update(T2.id[i],T2.id[i]+T2.siz[i]-1,1,n,1,a[i]);
    fr(i,1,n) ID.pb(i);
    shuffle(ID.begin(),ID.end(),rnd);
    // fr(i,0,min(n-1,B)) vis[ID[i]]=1;vis[1]=1;
    ID.clear();
    fr(i,1,n) vis[i]=1;
    fr(i,1,n) if(vis[i]) ID.pb(i);
    sort(ID.begin(),ID.end(),cmp);
    int ln=ID.size();
    fr(i,0,ln-2) ID.pb(T2.getlca(ID[i],ID[i+1]));
    sort(ID.begin(),ID.end(),cmp);
    ID.erase(unique(ID.begin(),ID.end()),ID.end());
    for(auto x:ID) vis[x]=1;
    fr(i,1,q) cin>>que[i].x>>que[i].y>>que[i].z;
    BL.into();
}
vector<pii> vc[Maxn];
inline void update(int x,int y,ull z){
    int llca=T1.getlca(x,y);
    // cout<<llca<<endl;
    BL.update(T1.id[x],z);BL.update(T1.id[y],z);
    BL.update(T1.id[llca],-2*z);
    // cout<<"**"<<endl;
    SGT.update(T2.id[llca],T2.id[llca]+T2.siz[llca]-1,1,n,1,z);
    a[llca]+=z;
}
inline ull query(int x){return BL.query(T1.id[x],T1.id[x]+T1.siz[x]-1);}
inline ull getval(int x,int y){
    int llca=T2.getlca(x,y);
    ull ans=0;
    ans=SGT.query(T2.id[x],T2.id[x],1,n,1);
    ans+=SGT.query(T2.id[y],T2.id[y],1,n,1);
    ans-=2*SGT.query(T2.id[llca],T2.id[llca],1,n,1);
    ans+=a[llca];
    return ans;
}
int id1[Maxn];
inline void query(int x,int y,int id){
    // cout<<"query:"<<x<<' '<<y<<' '<<id<<endl;
    ans[id]=getval(x,y);
    // cout<<"ans:"<<ans[id]<<endl;
    while(1){
        // cout<<x<<' '<<y<<endl;
        if(vis[x] && vis[y]) break;
        if(x==y){
            ans[id]+=query(x),x=T2.father[x];
            return;
        }
        if(vis[y]) ans[id]+=query(x),x=T2.father[x];
        else if(vis[x]) ans[id]+=query(y),y=T2.father[y];
        else {
            if(T2.dep[x]<T2.dep[y]) swap(x,y);
            // cout<<x<<endl;
            ans[id]+=query(x),x=T2.father[x];
            // cout<<"ans:"<<ans[id]<<endl;
        }
    }
    int llca=T2.getlca(x,y);
    // cout<<"llca:"<<x<<' '<<y<<' '<<llca<<endl;
    vc[x].pb(mk(id,1));vc[y].pb(mk(id,1));vc[llca].pb(mk(id,-2));
    id1[id]=llca;
}
inline void Update(int x,int y,ull z){
    // cerr<<x<<' '<<y<<' '<<z<<endl;
    SGT.update(T1.id[x],T1.id[x],1,n,1,z);
    SGT.update(T1.id[y],T1.id[y],1,n,1,z);
    int llca=T1.getlca(x,y);
    SGT.update(T1.id[llca],T1.id[llca],1,n,1,-2*z);
    // cerr<<"end\n";
}
inline ull getpoint(int x){return SGT.query(T1.id[x],T1.id[x]+T1.siz[x]-1,1,n,1)+a[x];}
int fl[Maxn],s[Maxn];
inline void dfs(int x,int fa){
    s[x]=s[fa]+fl[x];
    for(auto y:T1.vc[x]) if(y!=fa) dfs(y,x);
}
ull Sum=0;
inline void Add(int x,int y,ull z){
    int sum=0,llca=T1.getlca(x,y);
    sum=s[x]+s[y]-2*s[llca];
    Sum+=z*sum;
}
inline void into(int X){
    // cout<<"into:"<<X<<endl;
    int pre=X;
    fr(i,1,n) fl[i]=0;Sum=0;
    while(X) fl[X]=1,X=T2.father[X];
    dfs(1,0);
    int tim=0;
    for(auto p:vc[pre]){
        fr(i,tim+1,p.first) Add(que[i].x,que[i].y,que[i].z);
        ans[p.first]+=Sum*p.second;
        tim=p.first;
    }
}
inline void work(){
    // cout<<"dfn:\n";
    // fr(i,1,n) cout<<i<<' '<<T1.id[i]<<endl;
    fr(i,1,q) update(que[i].x,que[i].y,que[i].z),query(que[i].x,que[i].y,i);
    // cerr<<"**"<<endl;
    SGT.clear(1,1,n);fr(i,1,n) a[i]=0;
    // cerr<<"**"<<endl;
    // cout<<ans[1]<<endl;
    fr(i,1,q) Update(que[i].x,que[i].y,que[i].z),ans[i]+=getpoint(id1[i]);
    // cout<<ans[1]<<endl;
    for(auto x:ID) into(x);
    fr(i,1,q) cout<<ans[i]<<'\n';
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}