#include <bits/stdc++.h>
using namespace std;

using ULL = unsigned long long;

mt19937 rnd(random_device{}());

constexpr int N = 2e5 + 5;
constexpr int B = 400;

int n, m;
int key[N];
struct QQ {
  int u, v;
  ULL k;
  QQ(int u = 0, int v = 0, ULL k = 0) : u(u), v(v), k(k) {}
} q[N];
ULL A[N], ans[N];

struct Tree {
  vector<int> G[N];
  int dfn[N], siz[N], fa[N], rev[N];
  int ti, st[20][N], dep[N];
  void dfs(int u, int f) {
    dep[u] = dep[f] + 1, dfn[u] = ++ti, rev[ti] = u, siz[u] = 1;
    st[0][ti] = f, fa[u] = f;
    for (auto v : G[u]) if (v != f) {
      dfs(v, u);
      siz[u] += siz[v];
    }
  }
  #define get(u, v) (dep[u] < dep[v] ? u : v)
  void init() {
    for (int j = 1; j < 20; ++j) {
      for (int i = 1; i + (1 << j) - 1 <= n; ++i) {
        st[j][i] = get(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
      }
    }
  }
  int LCA(int u, int v) {
    if (u == v) return u;
    if ((u = dfn[u]) > (v = dfn[v])) swap(u, v);
    int h = __lg(v - u++);
    return get(st[h][u], st[h][v - (1 << h) + 1]);
  }
} T1, T2;

ULL num[N];

struct DS {
  ULL sum1[N], sum2[N];
  void add(int x, ULL y) {
    sum1[x] += y;
    sum2[x / B] += y;
  }
  ULL qry(int x) {
    ULL res = 0;
    // for (int i = x; i >= 0; --i) res += sum1[i];
    for (int i = x; i >= 0 && (i / B) == (x / B); --i) res += sum1[i];
    for (int i = (x / B) - 1; i >= 0; --i) res += sum2[i];
    return res;
  }
} ds;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> A[i];
  }
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    T1.G[u].emplace_back(v);
    T1.G[v].emplace_back(u);
  }
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    T2.G[u].emplace_back(v);
    T2.G[v].emplace_back(u);
  }
  T1.dfs(1, 0), T1.init();
  T2.dfs(1, 0), T2.init();
  for (int i = 0; i < m; ++i) {
    auto &[u, v, k] = q[i];
    cin >> u >> v >> k;
  }
  vector<int> o(n);
  {
    iota(o.begin(), o.end(), 1);
    sort(o.begin(), o.end(), [&](int u, int v) {
      return T1.dep[u] > T1.dep[v];
    });
    for (auto u : o) if (!key[u]) {
      bool f = true;
      int v = u;
      for (int j = 1; T1.fa[v] && j < B; ++j) {
        v = T1.fa[v];
        if (key[v]) {f = false; break;}
      }
      if (f) key[v] = true;
    }
    sort(o.begin(), o.end(), [&](int u, int v) {
      return key[u] > key[v];
    });
  }
  for (int u = 1; u <= n; ++u) {
    ds.add(T2.dfn[u], A[u]);
    ds.add(T2.dfn[u] + T2.siz[u], -A[u]);
  }
  auto addS = [&](int u, ULL k) {
    while (u && !key[u]) {
      ds.add(T2.dfn[u], k);
      ds.add(T2.dfn[u] + T2.siz[u], -k);
      u = T1.fa[u];
    }
  };
  vector<int> L1(m), L2(m);
  for (int i = 0; i < m; ++i) {
    auto [u, v, k] = q[i];
    {
      int x = T1.LCA(u, v); L1[i] = x;
      addS(u, k);
      addS(v, k);
      addS(x, -k);
      addS(T1.fa[x], -k);
    }
    {
      int x = T2.LCA(u, v); L2[i] = x;
      ans[i] += ds.qry(T2.dfn[u]) + ds.qry(T2.dfn[v]) - ds.qry(T2.dfn[x]);
      if (T2.fa[x]) ans[i] -= ds.qry(T2.dfn[T2.fa[x]]);
    }
  }
  // fprintf(stderr, "%.2f\n", double(clock()) / CLOCKS_PER_SEC);
  // for (int i = 0; i < m; ++i) {
  //   cerr << ans[i] << " \n";
  // }
  for (int i = 0; i < n; ++i) {
    int s = o[i];
    if (!key[s]) break;
    fill(num + 1, num + n + 1, 0);
    {
      int u = s;
      do {
        num[u]++;
        u = T1.fa[u];
      } while (u && !key[u]);
      for (int j = 1; j <= n; ++j) {
        u = T2.rev[j];
        num[u] += num[T2.fa[u]];
      }
    }
    ULL res = 0;
    auto addB = [&](int u, ULL k) {
      if (T1.dfn[s] <= T1.dfn[u] && T1.dfn[u] < T1.dfn[s] + T1.siz[s]) {
        res += k;
      }
    };
    auto qry = [&](int u) {
      return res * num[u];
    };
    for (int j = 0; j < m; ++j) {
      auto [u, v, k] = q[j];
      {
        int x = L1[j];
        addB(u, k);
        addB(v, k);
        addB(x, -k);
        addB(T1.fa[x], -k);  
      }
      {
        int x = L2[j];
        ans[j] += qry(u) + qry(v) - qry(x);
        if (T2.fa[x]) ans[j] -= qry(T2.fa[x]);
      }
    }
  }
  for (int i = 0; i < m; ++i) {
    cout << ans[i] << " \n";
  }
  return 0;
}