#include<bits/stdc++.h>
# define ull unsigned long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define N 200005
# define B 400
# define hd(i) hd[id][i]
# define to(i) to[id][i]
# define nxt(i) nxt[id][i]
# define p(i) p[id][i]
# define t1(i) t1[id][i]
# define t2(i) t2[id][i]
# define st(i, j) st[id][i][j]
using namespace std;

mt19937 rng(time(0));
int n, m, hd[2][N], to[2][2 * N], nxt[2][2 * N], etimer[2];
int p[2][N], t1[2][N], t2[2][N], st[2][N][20], timer[2];
int gp[N], plc[N], lst[N];
short cnt[N][B + 5];
ull a[N], lazy[B + 5], big[N], sml[N];
void addedge(int u, int v, int id){to(++etimer[id]) = v, nxt(etimer[id]) = hd(u), hd(u) = etimer[id];}
void dfs(int u, int fa, int id)
{
	p(u) = st(u, 0) = fa, t1(u) = ++timer[id];
	rep(i, 1, 18) st(u, i) = st(st(u, i - 1), i - 1);
	if (id) rep(i, 1, B) cnt[u][i] += cnt[fa][i];
	for (int i = hd(u); i; i = nxt(i)) if (to(i) != fa) dfs(to(i), u, id);
	t2(u) = timer[id];
}
bool up(int u, int v, int id){return !u || t1(u) <= t1(v) && t2(u) >= t2(v);}
int lca(int u, int v, int id)
{
	if (up(u, v, id)) return u; if (up(v, u, id)) return v;
	for (int i = 18; i >= 0; --i) if (!up(st(u, i), v, id)) u = st(u, i);
	return p(u);
}
void add(int x, ull num){big[x >> 9] += num, sml[x] += num;}
void deal(int u, ull k)
{
	while (u && !gp[u]) add(t1[1][u], k), add(t2[1][u] + 1, -k), u = p[0][u];
	while (u) lazy[gp[u]] += k, u = lst[u];
}
ull calc(int u)
{
	ull ans = 0;
	rep(i, 0, (t1[1][u] >> 9) - 1) ans += big[i];
	rep(i, t1[1][u] - (t1[1][u] & 511), t1[1][u]) ans += sml[i];
	rep(i, 1, B) ans += (ull) (cnt[u][i]) * lazy[i];
	return ans;
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n >> m;
	rep(i, 1, n) cin >> a[i];
	rep(i, 1, n - 1) {int x, y; cin >> x >> y; addedge(x, y, 0), addedge(y, x, 0);}
	rep(i, 1, n - 1) {int x, y; cin >> x >> y; addedge(x, y, 1), addedge(y, x, 1);}
	dfs(1, 0, 0);
	rep(i, 1, min(B, n)) gp[i] = i; shuffle(gp + 1, gp + n + 1, rng);
	rep(i, 1, n) if (gp[i]) {plc[gp[i]] = i; int t = i; while (t && (!gp[t] || t == i)) ++cnt[t][gp[i]], t = p[0][t]; lst[i] = t;}
	dfs(1, 0, 1); rep(i, 1, n) add(t1[1][i], a[i]), add(t2[1][i] + 1, -a[i]);
	rep(i, 1, m)
	{
		int x, y; ull k; cin >> x >> y >> k;
		int la = lca(x, y, 0); deal(x, k), deal(y, k), deal(la, -2ull * k), add(t1[1][la], k), add(t2[1][la] + 1, -k);
		la = lca(x, y, 1); cout << calc(x) + calc(y) - calc(la) - calc(p[1][la]) << '\n';
	}
	return 0;
}