#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
const int N=2e5+5,T=500,B=500;
struct msg{
	int bh,x,y,c,z;
};
vector<msg>q1,q2,q[N];
struct nds{
	int dx,bh,z;
};
vector<nds>g[N];
int n,m,idx,f[N],w[N],rs[N],laz[N],sm[N],st[N],ed[N],bh[N],lx[N],dfn[N],eds[N],dy1[N],dy2[N],idx1,idx2,mk[N],w1[N],w2[N],dep1[N],dep2[N],f1[N][20],f2[N][20];
vector<int>p1[N],p2[N];
void dfs1(int x){
	for(int i=1;i<=18;i++)f1[x][i]=f1[f1[x][i-1]][i-1];
	mk[x]=1;
	dy1[++idx1]=x;
	for(auto c:p1[x]){
		if(mk[c])continue;
		f1[c][0]=x;
		dep1[c]=dep1[x]+1;
		dfs1(c);
	}
	mk[x]=0;
}
void dfs2(int x){
	for(int i=1;i<=18;i++)f2[x][i]=f2[f2[x][i-1]][i-1];
	mk[x]=1;
	dy2[++idx2]=x;
	dfn[x]=idx2;
	for(auto c:p2[x]){
		if(mk[c])continue;
		f2[c][0]=x;
		dep2[c]=dep2[x]+1;
		dfs2(c);
	}
	eds[x]=idx2;
	mk[x]=0;
}
int up1(int x,int k){
	while(k){
		x=f1[x][__lg(k&-k)];
		k^=k&-k;
	}
	return x;
}
int up2(int x,int k){
	while(k){
		x=f2[x][__lg(k&-k)];
		k^=k&-k;
	}
	return x;
}
int lca1(int a,int b){
	if(dep1[a]>dep1[b])swap(a,b);
	b=up1(b,dep1[b]-dep1[a]);
	if(a==b)return a;
	for(signed i=18;i>=0;i--){
		if(f1[a][i]!=f1[b][i])a=f1[a][i],b=f1[b][i];
	}
	return f1[a][0];
}
int lca2(int a,int b){
	if(dep2[a]>dep2[b])swap(a,b);
	b=up2(b,dep2[b]-dep2[a]);
	if(a==b)return a;
	for(signed i=18;i>=0;i--){
		if(f2[a][i]!=f2[b][i])a=f2[a][i],b=f2[b][i];
	}
	return f2[a][0];
}
void solve(){
	q[++idx]=q2;
	for(auto c:q1){
		g[c.x].push_back({idx,c.bh,c.z});
		g[c.y].push_back({idx,c.bh,c.z});
		g[c.c].push_back({idx,c.bh,-c.z});
		g[f1[c.c][0]].push_back({idx,c.bh,-c.z});
	}
	memset(w1,0,sizeof(w1));
	for(auto c:q1){
		w1[c.x]+=c.z;
		w1[c.y]+=c.z;
		w1[c.c]-=c.z;
		if(c.c!=1)w1[f1[c.c][0]]-=c.z;
	}
	for(int i=n;i>1;i--){
		int x=dy1[i];
		w1[f1[x][0]]+=w1[x];
	}
	for(int i=1;i<=n;i++)w[i]+=w1[i],w2[i]=w[i];
    for(int i=2;i<=n;i++){
    	int x=dy2[i];
    	w2[x]+=w2[f2[x][0]];
    }
	q1.clear();
	q2.clear();
}
void ADD(int l,int r,int y){
	for(int i=l;i<=r;i++)sm[i]+=y;
}
void add(int x,int y){
	int l=dfn[x],r=eds[x];
	if(bh[l]==bh[r]){
		ADD(l,r,y);
		return;
	}
	int ll=bh[l]+1,rr=bh[r]-1;
	for(int i=ll;i<=rr;i++)laz[i]+=y;
    ADD(l,st[ll]-1,y);ADD(ed[rr]+1,r,y);
}
int gets(int x){
	if(!x)return 0;
	return sm[dfn[x]]+laz[bh[dfn[x]]];
}
int gets(int a,int b,int c){
	return gets(a)+gets(b)-gets(c)-gets(f2[c][0]);
}
void dfs(int x){
	add(x,1);
	mk[x]=1;
	for(auto c:g[x]){
		for(auto d:q[c.dx]){
			if(d.bh<c.bh)continue;
			rs[d.bh]+=gets(d.x,d.y,d.c)*c.z;
		}
	}
	for(auto c:p1[x]){
		if(mk[c])continue;
		dfs(c);
	}
	mk[x]=0;
	add(x,-1);
}
signed main(){
//	freopen("mist07.in","r",stdin);
//	freopen("out.txt","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>w[i],bh[i]=(i-1)/B+1;
	for(int i=1;i<=bh[n];i++)st[i]=ed[i-1]+1,ed[i]=min(i*B,n);
	for(int i=1;i<n;i++){
		int x,y;
		cin>>x>>y;
		p1[x].push_back(y);
		p1[y].push_back(x);
	}
	for(int i=1;i<n;i++){
		int x,y;
		cin>>x>>y;
		p2[x].push_back(y);
		p2[y].push_back(x);
	}
	dfs1(1);
	dfs2(1);
	solve();
	for(int i=1;i<=m;i++){
		int x,y,z;
		cin>>x>>y>>z;
		q1.push_back({i,x,y,lca1(x,y),z});
		int c=lca2(x,y);
		q2.push_back({i,x,y,c});
		lx[i]=1;
		rs[i]=w2[x]+w2[y]-w2[c];
		if(c!=1)rs[i]-=w2[f2[c][0]];
		if(i%T==0)solve();
		if(i%1000==0)cerr<<i<<endl;
	}
	solve();
	dfs(1);
	for(int i=1;i<=m;i++)if(lx[i])cout<<rs[i]<<"\n";
}