#include<bits/stdc++.h>
#define int unsigned long long
#define ull unsigned long long
using namespace std;
const int N=2e5+5,M=500;
ull a[N],tag[M],sum[M][M],cnt[M];
int n,m,B,sz1[N],fa1[N],d1[N],son1[N],dfn1[N],rk1[N],tp1[N],cnt1=0,sz2[N],fa2[N],d2[N],son2[N],dfn2[N],rk2[N],tp2[N],cnt2=0,bl[N],L[M],R[M],head[N],ecnt=0;
struct edge {int to,nxt;}e[N<<1];
void add(int u,int v) {e[++ecnt]=(edge){v,head[u]};head[u]=ecnt;}
void dfs1(int u,int pre,int dep,int *sz,int *fa,int *d,int *son) {
	int mx=0;
	sz[u]=1,fa[u]=pre,d[u]=dep;
	for(int i=head[u]; i; i=e[i].nxt) {
		int v=e[i].to;
		if(v==pre) continue;
		dfs1(v,u,dep+1,sz,fa,d,son);
		sz[u]+=sz[v];
		if(sz[v]>mx) {
			mx=sz[v];
			son[u]=v;
		}
	}
}
void dfs2(int u,int top,int &cnt,int son[],int fa[],int *dfn,int *rk,int *tp) {
	dfn[++cnt]=u,rk[u]=cnt,tp[u]=top;
	if(!son[u]) return;
	dfs2(son[u],top,cnt,son,fa,dfn,rk,tp);
	for(int i=head[u]; i; i=e[i].nxt) {
		int v=e[i].to;
		if(v==son[u]||v==fa[u]) continue;
		dfs2(v,v,cnt,son,fa,dfn,rk,tp);
	}
}
void modify(int l,int r,int k) {
	int ll=bl[l-1]+1,rr=bl[r+1]-1;
	for(int i=ll; i<=rr; i++) tag[i]+=k;
	for(int i=l; i<L[ll]; i++) a[dfn1[i]]+=k,cnt[bl[rk2[dfn1[i]]]]+=k;
	for(int i=R[rr]+1; i<=r; i++) a[dfn1[i]]+=k,cnt[bl[rk2[dfn1[i]]]]+=k;
}
ull calc(int x) {
	ull ans=0;
	int xx=bl[x+1]-1;
	for(int i=1; i<=(n-1)/B+1; i++) ans+=tag[i]*sum[i][xx];
	for(int i=1; i<=xx; i++) ans+=cnt[i];
	for(int i=R[xx]+1; i<=x; i++) ans+=a[dfn2[i]]+tag[bl[i]];
	return ans;
}
ull query(int l,int r) {return calc(r)-calc(l-1);}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n>>m;B=sqrt(n);
	for(int i=1; i<=n; i++) cin>>a[i];
	for(int i=1; i<n; i++) {
		int u,v;
		cin>>u>>v;
		add(u,v),add(v,u);
	}
	dfs1(1,0,1,sz1,fa1,d1,son1);
	dfs2(1,1,cnt1,son1,fa1,dfn1,rk1,tp1);
	memset(head,0,sizeof(head)),ecnt=0;
	for(int i=1; i<n; i++) {
		int u,v;
		cin>>u>>v;
		add(u,v),add(v,u);
	}
	dfs1(1,0,1,sz2,fa2,d2,son2);
	dfs2(1,1,cnt2,son2,fa2,dfn2,rk2,tp2);
	for(int i=1; i<=n; i++) bl[i]=(i-1)/B+1;
	bl[0]=0,bl[n+1]=(n-1)/B+2;
	for(int i=1; i<=(n-1)/B+1; i++) L[i]=(i-1)*B+1,R[i]=min(i*B,n);
	for(int i=1; i<=(n-1)/B+1; i++) {
		for(int j=L[i]; j<=R[i]; j++) sum[i][bl[rk2[dfn1[j]]]]++;
		for(int j=1; j<=(n-1)/B+1; j++) sum[i][j]+=sum[i][j-1];
	}
	for(int i=1; i<=(n-1)/B+1; i++) for(int j=L[i]; j<=R[i]; j++) cnt[i]+=a[dfn2[j]];
	while(m--) {
		int x,y,k;
		cin>>x>>y>>k;
		int keepx=x,keepy=y;
		while(tp1[x]!=tp1[y]) {
			if(d1[tp1[x]]<d1[tp1[y]]) swap(x,y);
			modify(rk1[tp1[x]],rk1[x],k);
			x=fa1[tp1[x]];
		}
		if(d1[x]>d1[y]) swap(x,y);
		modify(rk1[x],rk1[y],k);
		ull ans=0;
		x=keepx,y=keepy;
		while(tp2[x]!=tp2[y]) {
			if(d2[tp2[x]]<d2[tp2[y]]) swap(x,y);
			ans+=query(rk2[tp2[x]],rk2[x]);
			x=fa2[tp2[x]];
		}
		if(d2[x]>d2[y]) swap(x,y);
		ans+=query(rk2[x],rk2[y]);
		cout<<ans<<'\n';
	}
	return 0;
}