#include<bits/extc++.h>
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
//This code contains niche emotional elements. It is recommended to watch it after the age of 18.
#ifdef __unix__
#define gc getchar_unlocked
#define pc putchar_unlocked
#else
#define gc _getchar_nolock
#define pc _putchar_nolock
#endif
#define debug(x) fprintf(stderr,"Line %d,%s=%lld\n",__LINE__,#x,(ll)(x))
#define debugline fprintf(stderr,"--------------------------\n")
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define Inf (int)INFINITY
#define ull unsigned ll
#define inf 0x3f3f3f3f
#define pb push_back
#define ll long long
#define endl '\n'
#define y second
#define x first
using namespace std;
const int N=2e5+10,B=450,M=N;


//char in[1<<20],*P1=in,*P2=in;
//#define getchar() (P1==P2&&(P2=(P1=in)+fread(in,1,1<<20,stdin),P1==P2)?EOF:*P1++)

void read(){};
template<class T1,class...T2>
inline void read(T1&ret,T2&...rest){
	ret=0;char c=gc();bool f=0;
	for(;!isdigit(c);c=gc())f=c=='-';
	for(;isdigit(c);c=gc())ret=ret*10+c-'0';
	f&&(ret=-ret),read(rest...);
}
#define cin(...) read(__VA_ARGS__)
template<class T>
inline void print(T x){
	static short s[35],t=0;
	bool f=x<0;if(f)x=-x;
	do s[t++]=x%10,x/=10;while(x);
	for(f&&pc('-');t;)pc(s[--t]+'0');
}
template<int N>struct LCA{
	basic_string<int>*nxt;
	int k,dn,d[N],dfn[N],mn[__lg(N)+1][N];
	int get(int u,int v){return dfn[u]<dfn[v]?u:v;}
	void pre(int u,int fa=0){
		d[u]=d[mn[0][dfn[u]=++dn]=fa]+1;
		for(int v:nxt[u])if(v^fa)pre(v,u);
	}
	inline void init(int n,int rt,basic_string<int>*t){
		nxt=t,pre(rt);
		for(int j=1;j<=__lg(n);j++)
			for(int i=1;i+(1<<j)-1<=n;i++)
				mn[j][i]=get(mn[j-1][i],mn[j-1][i+(1<<(j-1))]);
	}
	inline int operator()(int u,int v){
		if(u==v)return u;
		if((u=dfn[u])>(v=dfn[v]))swap(u,v);
		return k=__lg(v-u++),get(mn[k][u],mn[k][v-(1<<k)+1]);
	}
	inline int len(int u,int v){return d[u]+d[v]-2*d[(*this)(u,v)];}
};
basic_string<int>t0[N],t1[N];
int n,m,mt,p0[N],p1[N];
ull a[N],vl[N],res[N];
LCA<N>lca,lca1;
struct O{bool tg;int x,y;ull w;}o[N*5];
namespace FK{
	int dn,*dfn=lca.dfn,dfr[N],ix[N],R[M];
	ull s0[N],s1[M];
	void dfs0(int u,int fa=0){
		dfn[u]=++dn;
		for(int v:t0[u])
			if(v^fa)dfs0(v,u);
		dfr[u]=dn,p0[u]=fa;
	}
	inline void init(){
		dfs0(1);
		for(int i=1;i<=n;i++)R[ix[i]=(i+B-1)/B]=i;
	}
	inline ull query(int u){
		return s1[ix[dfr[u]]]+s0[dfr[u]]-s1[ix[dfn[u]-1]]-s0[dfn[u]-1];
	}
	inline void add(int u,ull v){
		for(int i=u=dfn[u];i<=R[ix[u]];i++)s0[i]+=v;
		for(int i=ix[u]+1;i<=ix[n];i++)s1[i]+=v;
	}
	inline void add(int u,int v,ll w){
		int l=lca(u,v);
		if(l!=1)add(p0[l],-w);
		add(u,w),add(v,w),add(l,-w);
	}
}
namespace TFK{
	const int B=200;
	int sz[N];
	bool tg[N];
	set<pii>st;
	basic_string<int>sp;
	void dfs(int u,int fa=0){
		p1[u]=fa,sz[u]=1;
		for(int v:t1[u])
			if(v^fa)vl[v]+=vl[u],dfs(v,u),sz[u]+=sz[v];
	}
	void era(int u,int d=0){
		if(d>B)return;
		st.erase({sz[u],u});
		for(int v:t1[u])
			if(v^p1[u])era(v,d+1);
	}
	inline void init(){
		dfs(1),sp+=1;
		for(int u=2;u<=n;u++)st.insert({sz[u],u});
		basic_string<int>&s=sp;
		for(int u;!st.empty()&&st.rbegin()->x>B;)
			era(u=st.rbegin()->y),s+=u;
		auto cmp=[&](const int&x,const int&y)
		->bool{return lca1.dfn[x]<lca1.dfn[y];};
		sort(all(s),cmp);
		for(int i=1,l=(int)(s.size());i<l;i++)s.pb(lca1(s[i-1],s[i]));
		sort(all(s),cmp),s.erase(unique(all(s)),s.end());
		sort(all(s)),s.erase(unique(all(s)),s.end());
		for(int u:s)tg[u]=1;
	}
}
namespace CT{
	basic_string<int>df;
	int fl,ct[N];
	void dfs(int u){
		df+=u;
		for(int v:t0[u])
			if(v^p0[u])dfs(v);
	}
	inline void init(int u){
		fill(ct+1,ct+n+1,0);
		for(int x=u;x;x=p1[x])ct[x]++;
		if(!fl)dfs(1),fl=1;
		for(int u:df)
			for(int v:t0[u])
				if(v^p0[u])ct[v]+=ct[u];
	}
	inline int count(int u,int v){
		int l=lca(u,v),r=ct[u]+ct[v]-ct[l];
		if(l!=1)r-=ct[p0[l]];
		return r;
	}
}
inline void Mmax(int &x,int y){x=max(x,y);}
int main(){
//	freopen("1.in","r",stdin);
//	freopen("1.ans","w",stdout);
	cin(n,m);
	for(int i=1;i<=n;i++)
		cin(a[i]),vl[i]=a[i];
	for(int i=1,u,v;i<n;i++)
		cin(u,v),t0[u]+=v,t0[v]+=u;
	for(int i=1,u,v;i<n;i++)
		cin(u,v),t1[u]+=v,t1[v]+=u;
	lca.init(n,1,t0),
	lca1.init(n,1,t1),
	FK::init(),TFK::init();
	cerr<<TFK::sp.size()<<endl;
	int mx=0;
	for(int i=1,u,v,l,x;i<=m;i++){
		ull w;cin(u,v,w),FK::add(u,v,w),l=lca1(u,v);
		res[i]=vl[u]+vl[v]-vl[l];
		o[++mt]={0,u,v,w};
		int rl=0;
		for(x=u;!TFK::tg[x];x=p1[x],++rl)
			res[i]+=FK::query(x);
		Mmax(mx,rl),rl=0;
		o[++mt]={1,i,x,1};
		for(x=v;!TFK::tg[x];x=p1[x],++rl)
			res[i]+=FK::query(x);
		Mmax(mx,rl),rl=0;
		o[++mt]={1,i,x,1};
		for(x=l;!TFK::tg[x];x=p1[x],++rl)
			res[i]-=FK::query(x);
		Mmax(mx,rl),rl=0;
		o[++mt]={1,i,x,0};
		if(l>1){
			for(x=p1[l];!TFK::tg[x];x=p1[x],++rl)
				res[i]-=FK::query(x);
			Mmax(mx,rl),rl=0;
			res[i]-=vl[p1[l]],o[++mt]={1,i,x,0};
		}
	}
	if(n>=200000)
	return print(mx),0;
//	double ST=clock();
	for(int u:TFK::sp){
		CT::init(u);
		ull sum=0;
		for(int i=1;i<=mt;i++){
			if(o[i].tg){
				if(o[i].y==u)
					res[o[i].x]+=(o[i].w?1:-1)*sum;
			}
			else
				sum+=o[i].w*CT::count(o[i].x,o[i].y);
		}
	}
//	cerr<<clock()-ST<<endl;
	for(int i=1;i<=m;i++)
		print(res[i]),pc(endl);
	return 0;
}