#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
//#define int ll
bool ST;
static const ll MOD=1e9+9,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
	inline bool operator <(const tup t)const
	{return x<t.x||(x==t.x&&y<t.y)
	||(x==t.x&&y==t.y&&z<t.z);}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[40];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' '&&st!='\r'&&st!='\0')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	int n,m;
	int len,c[200010];
	ull a[200010],s[200010],ans[200010],cont[200010];
	int p[200010],top[200010];
	bool vis[200010],ins[200010];
	vp ve[200010];
	namespace DS
	{
		const int BB=450;
		ull v[200010],tg[510];
		int b[200010];
		inline void init()
		{
			for(int i=1;i<=n;++i)b[i]=(i-1)/BB+1;
		}
		inline void add(int x,ull y)
		{
			if(!x)return;
			for(int i=x;b[i]==b[x];--i)v[i]+=y;
			for(int i=1;i<b[x];++i)tg[i]+=y;
		}
		inline ull ask(int x){return v[x]+tg[b[x]];}
	}
	using namespace DS;
	struct Tree
	{
		vi T[200010];
		int tot,dfn[200010],F[17][200010],siz[200010],Fa[200010];
		void dfs(int x,int fa=0)
		{
			dfn[x]=++tot;
			siz[x]=1;
			Fa[x]=F[0][tot]=fa;
			for(auto to:T[x])if(to!=fa)
			dfs(to,x),siz[x]+=siz[to];
		}
		inline int get(int x,int y){return dfn[x]<dfn[y]?x:y;}
		inline int LCA(int x,int y)
		{
			if(x==y)return x;
			if((x=dfn[x])>(y=dfn[y]))swap(x,y);
			int k=__lg(y-x++);
			return get(F[k][x],F[k][y-(1<<k)+1]);
		}
		void init()
		{
			dfs(1);
			for(int i=1;i<17;++i)for(int j=1;j+(1<<i)-1<=n;++j)
			F[i][j]=get(F[i-1][j],F[i-1][j+(1<<(i-1))]);
		}
	}T1,T2;
	inline ull get(int id){return ask(T1.dfn[id])-ask(T1.dfn[id]+T1.siz[id]);}
	void dfs0(int x,int fa=0)
	{
		top[x]=top[fa];
		if(vis[x])top[x]=x;
		s[x]+=a[x];
		for(auto to:T2.T[x])if(to!=fa)
		s[to]=s[x],dfs0(to,x);
	}
	void dfs1(int x,int fa=0)
	{
		c[++len]=x;
		for(auto to:T1.T[x])if(to!=fa)
		dfs1(to,x);
	}
	ull query(int x)
	{
		ull s=0;
		while(!vis[x])s+=get(x),x=T2.Fa[x];
		return s;
	}
	struct Node
	{
		int x,y,lca1,lca2;
		ull z;
		Node(int _x=0,int _y=0,ull _z=0,int _lca1=0,int _lca2=0)
		{x=_x,y=_y,z=_z,lca1=_lca1,lca2=_lca2;}
	}q[200010];
	mt19937 rnd(time(0));
	inline int rd(int l,int r){return l+rnd()%(r-l+1);}
	const int B=1500;
	void mian()
	{
		int x,y;
		ull z;
		
		read(n,m);
		for(int i=1;i<=n;++i)read(a[i]);
		for(int i=1;i<n;++i)read(x,y),T1.T[x].eb(y),T1.T[y].eb(x);
		for(int i=1;i<n;++i)read(x,y),T2.T[x].eb(y),T2.T[y].eb(x);
		DS::init();
		T1.init(),T2.init();
		for(int i=1;i<=n;++i)p[i]=i,swap(p[rd(1,i)],p[i]);
		for(int i=1;i<=min(n,B);++i)vis[p[i]]=1;
		vis[0]=1;
		dfs0(1),dfs1(1);
//		cerr<<s[1]<<" "<<s[3]<<" "<<s[2]<<endl;
//		cerr<<a[1]<<" "<<a[3]<<" "<<a[2]<<endl;
		
		int lca1,lca2;
		db sum=0;
		for(int i=1;i<=m;++i)
		{
			read(x,y,z);
			lca1=T1.LCA(x,y);
			lca2=T2.LCA(x,y);
			q[i]=Node(x,y,z,lca1,lca2);
			add(T1.dfn[x],z),add(T1.dfn[y],z);
			add(T1.dfn[lca1],-z),add(T1.dfn[T1.Fa[lca1]],-z);
			ans[i]=s[x]+s[y]-2*s[lca2]+a[lca2];
			db st=clock();
			ans[i]+=query(x)+query(y)-query(lca2)-query(T2.Fa[lca2]);
			sum+=clock()-st;
			ve[top[x]].eb(mp(i,1));
			ve[top[y]].eb(mp(i,1));
			ve[top[lca2]].eb(mp(i,-1));
			ve[top[T2.Fa[lca2]]].eb(mp(i,-1));
		}
//		cerr<<sum<<endl;
//		exit(0);
		for(int i=1;i<=min(n,B);++i)
		{
			x=p[i];
			memset(ins,0,sizeof(ins));
			while(x)ins[x]=1,x=T2.Fa[x];
			for(int j=1;j<=n;++j)cont[c[j]]=cont[T1.Fa[c[j]]]+ins[c[j]];
			int j=0;
			ull tmp=0;
			for(auto [k,v]:ve[p[i]])
			{
				while(j<k)
				{
					++j;
					tmp+=(cont[q[j].x]+cont[q[j].y]-cont[q[j].lca1]-cont[T1.Fa[q[j].lca1]])*q[j].z;
				}
				ans[k]+=tmp*v;
			}
		}
		for(int i=1;i<=m;++i)write(ans[i],'\n');
	}
	inline void Mian()
	{
		int T=1;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	ios::sync_with_stdio(0);
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}