#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

#define ull unsigned long long

using namespace std;

#define gc getchar
inline int read(){
	int x=0;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar());
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x;
}
inline ull readu(){
	ull x=0;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar());
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=2e5+5;
const int B=205;
// const int NB=(N/B+5)*2
// const int NB=N;

int n,q;

struct HLD_Tree{
	vector<int>G[N];
	int dep[N],dfn[N],top[N],hson[N],sz[N],fa[N],dfc;
	void dfs1(int u){
		dep[u]=dep[fa[u]]+1,sz[u]=1;
		for(int v:G[u])if(v!=fa[u]){
			fa[v]=u,dfs1(v),sz[u]+=sz[v];
			if(sz[v]>sz[hson[u]])hson[u]=v;
		}
	}
	void dfs2(int u,int tp){
		dfn[u]=++dfc,top[u]=tp;
		if(hson[u])dfs2(hson[u],tp);
		for(int v:G[u])if(v!=fa[u]&&v!=hson[u])dfs2(v,v);
	}
	void build(){dfs1(1),dfs2(1,1);}
	int LCA(int u,int v){
		while(top[u]!=top[v]){
			if(dep[top[u]]<dep[top[v]])swap(u,v);
			u=fa[top[u]];
		}
		if(dep[u]>dep[v])swap(u,v);
		return u;
	}
}T1,T2;

int dep[N],mxdis[N],dfn[N],dfc;
vector<int>G[N],T[N];

void dfs_dep(int u,int fa){
	// cout<<"dfs_dep "<<u<<" "<<fa<<endl;
	mxdis[u]=0,dfn[u]=++dfc;
	for(int v:G[u])if(v!=fa)dep[v]=dep[u]+1,dfs_dep(v,u),cmax(mxdis[u],mxdis[v]+1);
}
bool In[N];
vector<int>nodes;

vector<vector<int> >cc;
int Id[N],ccnt;
void dfs_cc(int u,int fa,int id){
	cc[id][u]+=cc[id][fa];
	for(int v:T[u])if(v!=fa)dfs_cc(v,u,id);
}

void build(){
	dfs_dep(1,0);
	int mxdep=0;
	for(int i=1;i<=n;i++)cmax(mxdep,dep[i]);
	// cerr<<"mxdep = "<<mxdep<<endl;
	// cout<<"dep = ";for(int i=1;i<=n;i++)cout<<dep[i]<<" ";puts("");
	// cout<<"mxdis = ";for(int i=1;i<=n;i++)cout<<mxdis[i]<<" ";puts("");
	for(int i=1;i<=n;i++)if(dep[i]%B==0&&mxdis[i]>=B)nodes.emplace_back(i);
	// cout<<"now nodes = ";for(int x:nodes)cout<<x<<" ";puts("");

	sort(nodes.begin(),nodes.end(),[&](int x,int y){return dfn[x]<dfn[y];});
	vector<int>new_nodes=nodes;
	for(int i=0;i+1<nodes.size();i++)new_nodes.emplace_back(T1.LCA(nodes[i],nodes[i+1]));
	auto rec=[&](vector<int>&A){sort(A.begin(),A.end()),A.resize(unique(A.begin(),A.end())-A.begin());};
	new_nodes.emplace_back(1);rec(new_nodes);nodes=new_nodes;
	for(int x:nodes)In[x]=true;

	// assert(nodes.size()<=NB);
	ccnt=nodes.size();
	cc.resize(ccnt,vector<int>(n+1,0));

	// cerr<<"ccnt = "<<ccnt<<endl;
	// cerr<<"nodes = ";for(int x:nodes)cerr<<x<<" ";cerr<<endl;

	for(int i=1;i<=n;i++)Id[i]=-1;
	for(int i=0;i<nodes.size();i++){
		// cout<<""
		int x=nodes[i],y=x;Id[x]=i;
		while(y)cc[i][y]=1,y=T1.fa[y];
		dfs_cc(1,0,i);
		// cout<<"cc "<<i<<" = ";for(int j=1;j<=n;j++)cout<<cc[i][j]<<" \n"[j==n];
	}
}
ull tag[N];

namespace ds{

const int C=605;
const int NC=N/C+5;

int bl[N],L[NC],R[NC];
ull sum[NC],val[N];

void build(){
	memset(L,63,sizeof(L));
	for(int i=1;i<=n;i++)bl[i]=(i-1)/C+1;
	for(int i=1;i<=n;i++)cmax(R[bl[i]],i),cmin(L[bl[i]],i);
}

void Add(int x,ull v){if(1<=x&&x<=n)sum[bl[x]]+=v,val[x]+=v;}
ull Sum(int l,int r){
	ull ans=0;
	if(l>r)return ans;
	if(bl[l]==bl[r]){for(int i=l;i<=r;i++)ans+=val[i];return ans;}
	for(int i=l;i<=R[bl[l]];i++)ans+=val[i];
	for(int i=L[bl[r]];i<=r;i++)ans+=val[i];
	for(int i=bl[l]+1;i<=bl[r]-1;i++)ans+=sum[i];
	return ans;
}

}

ull a[N];
void Add_1(int x,ull v){
	// cout<<"Add "<<x<<" "<<v<<endl;
	// cout<<"Add_1 "<<x<<" "<<v<<" -> dfn = "<<T2.dfn[x]<<" sz = "<<T2.sz[x]<<endl;
	ds::Add(T2.dfn[x],v),ds::Add(T2.dfn[x]+T2.sz[x],-v);
	// F.add(T2.dfn[x],v),F.add(T2.dfn[x]+T2.sz[x],-v);
}
ull Qsum_1(int x,int y){
	int z=T2.LCA(x,y);
	// cout<<"Qsum "<<x<<" "<<y<<" = "<<ds::Sum(T2.dfn[z],T2.dfn[x])+ds::Sum(T2.dfn[z],T2.dfn[y])<<endl;
	// int dx=T2.dfn[x],dy=T2.dfn[y],dz=T2.dfn[z],df=T2.dfn[T2.fa[z]];
	return ds::Sum(T2.dfn[z]+1,T2.dfn[x])+ds::Sum(T2.dfn[T2.fa[z]]+1,T2.dfn[y]);
}

void Add(int x,int y,ull k){
	// cout<<"Add "<<x<<" "<<y<<" "<<k<<endl;
	int z=T1.LCA(x,y);
	while(x!=z&&Id[x]==-1)Add_1(x,k),x=T1.fa[x];
	while(y!=z&&Id[y]==-1)Add_1(y,k),y=T1.fa[y];
	if(x==y)return Add_1(x,k);

	// cerr<<"now x,y = "<<x<<" "<<y<<" Id = "<<Id[x]<<" "<<Id[y]<<endl;

	if(Id[x]!=-1&&Id[y]!=-1){
		assert(Id[z]!=-1);
		tag[Id[x]]+=k,tag[Id[y]]+=k,tag[Id[z]]-=k+k,Add_1(z,k);
	}
	else{
		if(Id[y]!=-1)swap(x,y);
		assert(Id[x]!=-1&&Id[y]==-1&&y==z);
		// cerr<<" -> x,y = "<<x<<" "<<y<<" Id = "<<Id[x]<<" "<<Id[y]<<endl;
		y=T1.fa[y];
		while(Id[y]==-1)Add_1(y,-k),y=T1.fa[y];
		// cerr<<" -> y = "<<y<<endl;
		tag[Id[x]]+=k,tag[Id[y]]-=k;
	}
}

ull Qsum(int x,int y){
	ull ans=0;
	int z=T2.LCA(x,y),fz=T2.fa[z];
	for(int i=0;i<ccnt;i++){
		int cnt=cc[i][x]+cc[i][y]-cc[i][z]-cc[i][fz];
		// cout<<"i = "<<i<<" tag = "<<tag[i]<<" cnt = "<<cnt<<endl;
		ans+=((ull)(cnt))*tag[i];
	}
	// cout<<"now ans = "<<ans<<endl;
	ans+=Qsum_1(x,y);
	return ans;
}

signed main(void){

#ifndef ONLINE_JUDGE
	// freopen("in.txt","r",stdin);
	// freopen("b.in","r",stdin);
	// freopen("mist04.in","r",stdin);
	// freopen("mist04.ans","w",stdout);
#endif

	// double st=clock();
	n=read(),q=read();
	for(int i=1;i<=n;i++)a[i]=readu();
	for(int i=1;i<=n-1;i++){
		int u=read(),v=read();
		// cout<<u<<" "<<v<<endl;
		G[u].emplace_back(v),G[v].emplace_back(u);
		T1.G[u].emplace_back(v),T1.G[v].emplace_back(u);
	}
	for(int i=1;i<=n-1;i++){
		int u=read(),v=read();
		T[u].emplace_back(v),T[v].emplace_back(u);
		T2.G[u].emplace_back(v),T2.G[v].emplace_back(u);
	}

	ds::build();

	T1.build(),T2.build(),build();
	for(int i=1;i<=n;i++)Add_1(i,a[i]);

	for(int i=1;i<=q;i++){
		int x=read(),y=read();ull k=readu();
		Add(x,y,k);
		cout<<Qsum(x,y)<<'\n';
	}

	// cerr<<"time = "<<clock()-st<<"ms\n";

	return 0;
}