#include <bits/stdc++.h>
#define pii pair<int, int>
#define eb emplace_back
#define ull unsigned long long
using namespace std;
const int N = 200200, B = 470;
int n, m, s, t;
int p[N], q[N];
struct Tree{
    vector<int> to[N];
    int dfn[N], rnk[N], fa[N], nw, siz[N], son[N], top[N], dep[N];
    void add(int u, int v) {
        to[u].eb(v), to[v].eb(u);
    }
    void dfs1(int u, int dp) {
        siz[u] = 1, dep[u] = dp;
        for (int v : to[u]) if (v != fa[u]) {
            fa[v] = u, dfs1(v, dp + 1);
            if (!son[u] || siz[v] > siz[son[u]]) son[u] = v;
        }
        return;
    }
    void dfs2(int u, int tp) {
        top[u] = tp, dfn[u] = ++nw, rnk[nw] = u;
        if (son[u]) dfs2(son[u], tp);
        else return;
        for (int v : to[u]) if (v != fa[u] && v != son[u]) dfs2(v, v);
        return;
    }
    vector<pii> qr(int u, int v) {
        vector<pii> ans;
        while (top[u] != top[v]) {
            if (dep[top[u]] < dep[top[v]]) swap(u, v);
            ans.emplace_back(dfn[top[u]], dfn[u]), u = fa[top[u]];
        }
        if (dep[u] < dep[v]) swap(u, v);
        ans.emplace_back(dfn[v], dfn[u]);
        return ans;
    }
    void solve() {
        dfs1(1, 1), dfs2(1, 1);
    }
} tr1, tr2;
ull a[N], k, add[B], ct[B], sm[B][B], bl[B], br[B], frm[N], ret[N];
// add是对整块的贡献，ret是散块对散块，ct是整块对散块
void init() {
    for (int i = 1, x, y; i < n; ++i) scanf("%d%d", &x, &y), tr1.add(x, y);
    for (int i = 1, x, y; i < n; ++i) scanf("%d%d", &x, &y), tr2.add(x, y);
    tr1.solve(), tr2.solve();
    for (int i = 1; i <= n; ++i) p[i] = tr2.dfn[tr1.rnk[i]], q[tr2.dfn[tr1.rnk[i]]] = i;
    s = sqrt(n);
    for (int i = 1, j = s; i <= n; i = j + 1, j = min(n, j + s)) {
        bl[++t] = i, br[t] = j;
        for (int k = i; k <= j; ++k) frm[k] = t;
    }
    for (int i = 1; i <= n; ++i) ++sm[frm[i]][frm[p[i]]];
    for (int i = 1; i <= t; ++i) for (int j = 1; j <= t; ++j) sm[j][i] += sm[j - 1][i];
    for (int i = 1; i <= n; ++i) ret[tr2.dfn[i]] = a[i], add[frm[tr2.dfn[i]]] += a[i];
    return;
}
void modify(int l, int r, ull x) {
    if (frm[l] == frm[r]) {
        for (int i = l; i <= r; ++i) ret[p[i]] += x, add[frm[p[i]]] += x;
        return;
    }
    int L = frm[l], R = frm[r];
    for (int i = l; i <= br[L]; ++i) ret[p[i]] += x, add[frm[p[i]]] += x;
    for (int i = bl[R]; i <= r; ++i) ret[p[i]] += x, add[frm[p[i]]] += x;
    for (int i = L + 1; i < R; ++i) ct[i] += x;
    for (int i = 1; i <= t; ++i) add[i] += (sm[R - 1][i] - sm[L][i]) * x;
    return;
}
ull query(int l, int r) {
    ull ans = 0;
    if (frm[l] == frm[r]) {
        for (int i = l; i <= r; ++i) ans += ret[i] + ct[q[i]];
        return ans;
    }
    int L = frm[l], R = frm[r];
    for (int i = l; i <= br[L]; ++i) ans += ret[i] + ct[q[i]];
    for (int i = bl[R]; i <= r; ++i) ans += ret[i] + ct[q[i]];
    for (int i = L + 1; i < R; ++i) ans += add[i];
    return ans;
}
void solve(int x, int y, ull k) {
    vector<pii> o = tr1.qr(x, y);
    for (pii r : o) modify(r.first, r.second, k);
    ull ans = 0;
    o = tr2.qr(x, y);
    for (pii r : o) ans += query(r.first, r.second);
    printf("%llu\n", ans);
    return;
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%llu", a + i);
    init();
    for (int i = 1, x, y; i <= m; ++i) scanf("%d%d%llu", &x, &y, &k), solve(x, y, k);
    return 0;
}