#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pii pair<int, int>
#define pll pair<LL, LL>
#define fi first
#define se second
#define mkp make_pair
#define sz(x) (int)x.size()
using namespace std;
bool Mst;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

ULL readull() {
	ULL s = 0; char ch = getchar();
	while (ch < '0' || ch > '9') ch = getchar();
	while (ch >= '0' && ch <= '9') s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s;
}

mt19937 rnd(114514);

const int MAXN = 200005;

int n, m;
ULL a[MAXN];
vector<int> e[MAXN];
int fa[MAXN][20], dep[MAXN];
int dfn[MAXN], tim = 0, rnk[MAXN];

void pre(int x, int fat) {
	fa[x][0] = fat, dep[x] = dep[fat] + 1;
	dfn[x] = ++tim, rnk[tim] = x;
	for (int y : e[x])
		if (y != fat)
			pre(y, x);
}

int mov(int u, int d) {
	for (int i = 18; i >= 0; i--)
		if ((1 << i) <= d)
			d -= (1 << i), u = fa[u][i];
	return u;
}

int lca(int u, int v) {
	dep[u] > dep[v] ? u = mov(u, dep[u] - dep[v]) : v = mov(v, dep[v] - dep[u]);
	if (u == v) return u;
	for (int i = 18; i >= 0; i--)
		if (fa[u][i] != fa[v][i])
			u = fa[u][i], v = fa[v][i];
	return fa[u][0];
}

namespace Blocker {
	const int MAXC = 505;
	int B, C;
	int L[MAXC], R[MAXC], bl[MAXN];
	ULL sum[MAXC], val[MAXN];
	void init() {
		B = sqrt(n), C = (n - 1) / B + 1;
		for (int i = 1; i <= n; i++)
			bl[i] = (i - 1) / B + 1, R[bl[i]] = i;
		for (int i = n; i; i--)
			L[bl[i]] = i;
	}
	void mdf(int x, ULL v) {
		for (int i = x; i <= R[bl[x]]; i++) val[i] += v;
		for (int i = bl[x]; i <= C; i++) sum[i] += v;
	}
	ULL qry(int x) { return val[x] + sum[bl[x] - 1];}
	ULL qry(int l, int r) {
		return qry(r) - qry(l - 1);
	}
}

namespace Tree1 {
	vector<int> e[MAXN];
	void add(int u, int v) {
		e[u].push_back(v);
		e[v].push_back(u);
	}
	int fa[MAXN][20], dep[MAXN], dfn[MAXN], rnk[MAXN], tim = 0, sz[MAXN];
	void pre(int x, int fat) {
		dfn[x] = ++tim, rnk[tim] = x, sz[x] = 1;
		fa[x][0] = fat, dep[x] = dep[fat] + 1;
		for (int y : e[x])
			if (y != fat)
				pre(y, x), sz[x] += sz[y];
	}
	int mov(int u, int d) {
		for (int i = 18; i >= 0; i--)
			if ((1 << i) <= d)
				d -= (1 << i), u = fa[u][i];
		return u;
	}
	int lca(int u, int v) {
		dep[u] > dep[v] ? u = mov(u, dep[u] - dep[v]) : v = mov(v, dep[v] - dep[u]);
		if (u == v) return u;
		for (int i = 18; i >= 0; i--)
			if (fa[u][i] != fa[v][i])
				u = fa[u][i], v = fa[v][i];
		return fa[u][0];
	}
	void pre() {
		pre(1, 0);
		for (int j = 1; j <= 18; j++)
			for (int i = 1; i <= n; i++)
				fa[i][j] = fa[fa[i][j - 1]][j - 1];
	}
	void mdf(int x, int y, int l, ULL k) {
		Blocker::mdf(dfn[x], k), Blocker::mdf(dfn[y], k);
		Blocker::mdf(dfn[l], -k), Blocker::mdf(dfn[fa[l][0]], -k);
	}
	ULL qry(int x) {
		return Blocker::qry(dfn[x], dfn[x] + sz[x] - 1) + a[x];
	}
	int sum[MAXN];
	void dfs2(int x, int fa) {
		sum[x] += sum[fa];
		for (int y : e[x])
			if (y != fa)
				dfs2(y, x);
	}
	int qry(int u, int v, int l) {
		return sum[u] + sum[v] - sum[l] - sum[fa[l][0]];
	}
}

int p[MAXN], cnt = 0;
bool in[MAXN];

void spread() {
	cnt = 200;
	for (int i = 1; i <= cnt; i++) p[i] = rnd() % n + 1;
	p[++cnt] = 1;
	sort(p + 1, p + cnt + 1, [](int x, int y) {return dfn[x] < dfn[y];});
	for (int i = 2, len = cnt; i <= len; i++) p[++cnt] = lca(p[i], p[i - 1]);
	sort(p + 1, p + cnt + 1, [](int x, int y) {return dfn[x] < dfn[y];});
	cnt = unique(p + 1, p + cnt + 1) - p - 1;
	for (int i = 1; i <= cnt; i++) in[p[i]] = 1;
}

int x[MAXN], y[MAXN], l1[MAXN];
int p1[MAXN], p2[MAXN], p3[MAXN];
ULL ans[MAXN], k[MAXN];

int qry(int u, int i, ULL v) {
	while (!in[u])
		ans[i] += v * Tree1::qry(u), u = fa[u][0];
	return u;
}

bool Med;
signed main() {
	// freopen("mist7-9.in", "r", stdin);
	// freopen("1.out", "w", stdout);
	fprintf(stderr, "%.2lfMB\n", abs(&Med - &Mst) / 1048576.0);
	n = read(), m = read();
	for (int i = 1; i <= n; i++) a[i] = readull();
	for (int i = 1; i < n; i++) {
		int u = read(), v = read();
		Tree1::add(u, v);
	}
	for (int i = 1; i < n; i++) {
		int u = read(), v = read();
		e[u].push_back(v), e[v].push_back(u);
	}
	pre(1, 0), Tree1::pre();
	for (int j = 1; j <= 18; j++)
		for (int i = 1; i <= n; i++)
			fa[i][j] = fa[fa[i][j - 1]][j - 1];
	Blocker::init(), spread();
	for (int i = 1; i <= m; i++) {
		x[i] = read(), y[i] = read(), k[i] = readull(), l1[i] = Tree1::lca(x[i], y[i]);
		Tree1::mdf(x[i], y[i], l1[i], k[i]), p1[i] = qry(x[i], i, 1), p2[i] = qry(y[i], i, 1);
		// cout << ans[i] << endl;
		int l = lca(x[i], y[i]);
		p3[i] = qry(l, i, -2), ans[i] += Tree1::qry(l);
	}
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	for (int i = 1; i <= cnt; i++) {
		for (int j = 1; j <= n; j++) Tree1::sum[j] = 0;
		ULL res = 0;
		for (int j = p[i]; j; j = fa[j][0])
			Tree1::sum[j]++, res += a[j];
		Tree1::dfs2(1, 0);
		for (int j = 1; j <= m; j++) {
			int c = Tree1::qry(x[j], y[j], l1[j]);
			// cout << c << endl;
			res += k[j] * c;
			if (p1[j] == p[i]) ans[j] += res;
			if (p2[j] == p[i]) ans[j] += res;
			if (p3[j] == p[i]) ans[j] -= res * 2;
		}
	}
	for (int i = 1; i <= m; i++)
		printf("%llu\n", ans[i]);
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	return 0;
}