//Shirasu Azusa 2024.09
#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
int read() {
	int x=0,w=1; char c=getchar(); 
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
	return x*w;    
}

const int N=4e5+5;
ull n,Q,a[N],deg[N],g[1000][1000],s[N],t[N],w[N],pf[N];
int m,fa1[N],d1[N],p1[N],p2[N],d2[N],son1[N],son2[N],top1[N],top2[N],fa2[N],b1[N],b2[N],sz1[N],sz2[N],t1,t2,B;
vi e1[N],e2[N];

void dfs1(int u,int *fa,int *sz,int *son,vi *e) {
	for(int v:e[u]) if(v!=fa[u]) {
		fa[v]=u; pf[v]=pf[u]+a[v];
		dfs1(v,fa,sz,son,e);
		sz[u]+=sz[v];
		if(sz[son[u]]<sz[v]) son[u]=v;
	} sz[u]++;
}
void dfs2(int u,int tp,int *d,int *p,int *fa,int *son,int *top,vi *e,int &t) {
	//cout<<"DDD "<<u<<endl;
	p[++t]=u, d[u]=t, top[u]=tp;
	if(son[u]) dfs2(son[u],tp,d,p,fa,son,top,e,t);
	for(int v:e[u]) if(v!=fa[u]&&v!=son[u]) {
		dfs2(v,v,d,p,fa,son,top,e,t);
	}
}

void upd(int u,int v,int k) {
	int l=d1[u], r=d1[v]; if(l>r) swap(l,r);
	int pl=max(l/B,1), pr=min(m,r/B+1);
		rep(i,pl,pr) {
			int x=(i-1)*B+1, y=i*B;
			if(l<=x&&y<=r) s[i]+=k;
			else {
				x=max(x,l), y=min(y,r);
				rep(j,x,y) {
					int u=p1[j];
					t[b2[u]]+=k;
					w[u]+=k;
				}
			}
		}
}

int qry(int u,int v) {
	int l=d2[u], r=d2[v]; if(l>r) swap(l,r); int ans=0;
		int xl=(l-1)/B+2, xr=(r-1)/B;
		if(xl<=xr) {
			rep(i,1,m) {
				int ww=(g[i][xr]-g[i][xl-1]);
				ww=ww*s[i]; ans+=ww;
			}
			rep(i,xl,xr) ans+=t[i];
			int p=(xl-1)*B, q=xr*B+1;
			rep(i,l,p) ans+=w[p2[i]]+s[b1[p2[i]]];
			rep(i,q,r) ans+=w[p2[i]]+s[b1[p2[i]]];
		} else {
			rep(i,l,r) ans+=w[p2[i]]+s[b1[p2[i]]];
		}
	return ans;
}

signed main() {
	n=read(), Q=read(), B=sqrt(n);
	rep(i,1,n) a[i]=read();
	rep(i,2,n) {
		int u=read(), v=read();
		e1[u].eb(v), e1[v].eb(u);
	}
	dfs1(1,fa1,sz1,son1,e1);
	dfs2(1,1,d1,p1,fa1,son1,top1,e1,t1);
	rep(i,2,n) {
		int u=read(), v=read();
		e2[u].eb(v), e2[v].eb(u);
	}
	pf[1]=a[1]; dfs1(1,fa2,sz2,son2,e2);
	dfs2(1,1,d2,p2,fa2,son2,top2,e2,t2);
	//rep(i,1,n) cout<<p1[i]<<" "; puts("");
	//rep(i,1,n) cout<<p2[i]<<" "; puts("");
	rep(i,1,n) b1[i]=(d1[i]-1)/B+1;
	rep(i,1,n) b2[i]=(d2[i]-1)/B+1;
	rep(i,1,n) g[b1[i]][b2[i]]++;
	//rep(i,1,n) cout<<d2[i]<<" "; puts("");
	m=n/B+1;
	rep(i,1,m) rep(j,1,m) g[i][j]+=g[i][j-1];
	rep(i,1,Q) {
		int u=read(), v=read(), k=read();
		int x=u,y=v;
		while(top1[u]!=top1[v]) {
			if(d1[top1[u]]<d1[top1[v]]) swap(u,v);
			upd(top1[u],u,k); u=fa1[top1[u]];
		} upd(u,v,k);
		u=x, v=y; int ans=0;
		while(top2[u]!=top2[v]) {
			if(d2[top2[u]]<d2[top2[v]]) swap(u,v);
			//cout<<u<<" "<<v<<" "<<top2[u]<<" "<<top2[v]<<endl;
			ans+=qry(top2[u],u); u=fa2[top2[u]];
		} ans+=qry(u,v);
		int l=(d2[u]<d2[v]?u:v);
		ans+=pf[x]+pf[y]-pf[l]-pf[fa2[l]];
		//cout<<l<<" "<<pf[x]+pf[y]-pf[l]-pf[fa2[l]]<<endl;
		printf("%llu\n",ans);
	}
	return 0;
}