#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Hld {
  int n, rt;
  // needs to be tree
  // vertex lists
  // modified in build(rt) (parent removed, heavy child first)
  vector<vector<int>> graph;
  vector<int> sz, par, dep;
  int zeit;
  vector<int> dis, fin, sid;
  // head vertex (minimum depth) in heavy path
  vector<int> head;

  Hld() : n(0), rt(-1), zeit(0) {}
  explicit Hld(int n_) : n(n_), rt(-1), graph(n), zeit(0) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }

  void dfsSz(int u) {
    sz[u] = 1;
    for (const int v : graph[u]) {
      auto it = std::find(graph[v].begin(), graph[v].end(), u);
      if (it != graph[v].end()) graph[v].erase(it);
      par[v] = u;
      dep[v] = dep[u] + 1;
      dfsSz(v);
      sz[u] += sz[v];
    }
  }
  void dfsHld(int u) {
    dis[u] = zeit++;
    const int deg = graph[u].size();
    if (deg > 0) {
      int vm = graph[u][0];
      int jm = 0;
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        if (sz[vm] < sz[v]) {
          vm = v;
          jm = j;
        }
      }
      swap(graph[u][0], graph[u][jm]);
      head[vm] = head[u];
      dfsHld(vm);
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        head[v] = v;
        dfsHld(v);
      }
    }
    fin[u] = zeit;
  }
  void build(int rt_) {
    assert(0 <= rt_); assert(rt_ < n);
    rt = rt_;
    sz.assign(n, 0);
    par.assign(n, -1);
    dep.assign(n, -1);
    dep[rt] = 0;
    dfsSz(rt);
    zeit = 0;
    dis.assign(n, -1);
    fin.assign(n, -1);
    head.assign(n, -1);
    head[rt] = rt;
    dfsHld(rt);
    assert(zeit == n);
    sid.assign(n, -1);
    for (int u = 0; u < n; ++u) sid[dis[u]] = u;
  }

  friend ostream &operator<<(ostream &os, const Hld &hld) {
    const int maxDep = *max_element(hld.dep.begin(), hld.dep.end());
    vector<string> ss(2 * maxDep + 1);
    int pos = 0, maxPos = 0;
    for (int j = 0; j < hld.n; ++j) {
      const int u = hld.sid[j];
      const int d = hld.dep[u];
      if (hld.head[u] == u) {
        if (j != 0) {
          pos = maxPos + 1;
          ss[2 * d - 1].resize(pos, '-');
          ss[2 * d - 1] += '+';
        }
      } else {
        ss[2 * d - 1].resize(pos, ' ');
        ss[2 * d - 1] += '|';
      }
      ss[2 * d].resize(pos, ' ');
      ss[2 * d] += std::to_string(u);
      if (maxPos < static_cast<int>(ss[2 * d].size())) {
        maxPos = ss[2 * d].size();
      }
    }
    for (int d = 0; d <= 2 * maxDep; ++d) os << ss[d] << '\n';
    return os;
  }

  bool contains(int u, int v) const {
    return (dis[u] <= dis[v] && dis[v] < fin[u]);
  }
  int lca(int u, int v) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    for (; head[u] != head[v]; ) (dis[u] > dis[v]) ? (u = par[head[u]]) : (v = par[head[v]]);
    return (dis[u] > dis[v]) ? v : u;
  }
  int jumpUp(int u, int d) const {
    assert(0 <= u); assert(u < n);
    assert(d >= 0);
    if (dep[u] < d) return -1;
    const int tar = dep[u] - d;
    for (u = head[u]; ; u = head[par[u]]) {
      if (dep[u] <= tar) return sid[dis[u] + (tar - dep[u])];
    }
  }
  int jump(int u, int v, int d) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(d >= 0);
    const int l = lca(u, v);
    const int du = dep[u] - dep[l], dv = dep[v] - dep[l];
    if (d <= du) {
      return jumpUp(u, d);
    } else if (d <= du + dv) {
      return jumpUp(v, du + dv - d);
    } else {
      return -1;
    }
  }
  // [u, v) or [u, v]
  template <class F> void doPathUp(int u, int v, bool inclusive, F f) const {
    assert(contains(v, u));
    for (; head[u] != head[v]; u = par[head[u]]) f(dis[head[u]], dis[u] + 1);
    if (inclusive) {
      f(dis[v], dis[u] + 1);
    } else {
      if (v != u) f(dis[v] + 1, dis[u] + 1);
    }
  }
  // not path order, include lca(u, v) or not
  template <class F> void doPath(int u, int v, bool inclusive, F f) const {
    const int l = lca(u, v);
    doPathUp(u, l, false, f);
    doPathUp(v, l, inclusive, f);
  }

  // (vs, ps): compressed tree
  // vs: DFS order (sorted by dis)
  // vs[ps[x]]: the parent of vs[x]
  // ids[vs[x]] = x, not set for non-tree vertex
  vector<int> ids;
  pair<vector<int>, vector<int>> compress(vector<int> us) {
    // O(n) first time
    ids.resize(n, -1);
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    int usLen = us.size();
    assert(usLen >= 1);
    for (int x = 1; x < usLen; ++x) us.push_back(lca(us[x - 1], us[x]));
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    usLen = us.size();
    for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
    vector<int> ps(usLen, -1);
    for (int x = 1; x < usLen; ++x) ps[x] = ids[lca(us[x - 1], us[x])];
    return make_pair(us, ps);
  }
};

////////////////////////////////////////////////////////////////////////////////


// T: (commutative) monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class X, class Y, class T> struct KdTree {
  int n, nn;
  // ((x, y), i): permuted
  using Point = pair<pair<X, Y>, int>;
  vector<Point> ps;
  // leaf for point i
  vector<int> us;
  struct Node {
    T t;
    int l, r;
    X minX, maxX;
    Y minY, maxY;
  };
  vector<Node> nodes;
  KdTree() : n(0), nn(0), ps(), us(), nodes() {}
  void add(X x, Y y) {
    const int i = ps.size();
    ps.emplace_back(std::make_pair(x, y), i);
  }
  void build() {
    n = ps.size();
    assert(n >= 1);
    us.resize(n);
    nodes.resize(2 * n - 1);
    buildRec(0, n, 0);
  }
  int buildRec(int jL, int jR, int dir) {
    const int u = nn++;
    Node &node = nodes[u];
    node.minX = node.maxX = ps[jL].first.first;
    node.minY = node.maxY = ps[jL].first.second;
    if (jL + 1 == jR) {
      us[ps[jL].second] = u;
      node.l = node.r = -1;
    } else {
      for (int j = jL + 1; j < jR; ++j) {
        if (node.minX > ps[j].first.first) node.minX = ps[j].first.first;
        if (node.maxX < ps[j].first.first) node.maxX = ps[j].first.first;
        if (node.minY > ps[j].first.second) node.minY = ps[j].first.second;
        if (node.maxY < ps[j].first.second) node.maxY = ps[j].first.second;
      }
      const int jMid = jL + (jR - jL) / 2;
      if (dir == 0) {
        std::nth_element(ps.begin() + jL, ps.begin() + jMid, ps.begin() + jR,
                         [&](const Point &p0, const Point &p1) -> bool {
                           return (p0.first.first < p1.first.first); 
                         });
      } else {
        std::nth_element(ps.begin() + jL, ps.begin() + jMid, ps.begin() + jR,
                         [&](const Point &p0, const Point &p1) -> bool {
                           return (p0.first.second < p1.first.second);
                         });
      }
      node.l = buildRec(jL, jMid, dir ^ 1);
      node.r = buildRec(jMid, jR, dir ^ 1);
    }
    return u;
  }
  const T &all() const {
    return nodes[0].t;
  }
  T &at(int i) {
    return nodes[us[i]].t;
  }
  void pullAll() {
    for (int u = nn; --u >= 0; ) if (~nodes[u].l) pull(u);
  }

  inline void push(int u) {
    nodes[u].t.push(nodes[nodes[u].l].t, nodes[nodes[u].r].t);
  }
  inline void pull(int u) {
    nodes[u].t.pull(nodes[nodes[u].l].t, nodes[nodes[u].r].t);
  }

  // Applies T::f(args...) to point i.
  template <class F, class... Args>
  void chLeaf(int i, F f, Args &&... args) {
    chLeafRec(0, us[i], f, args...);
  }
  template <class F, class... Args>
  void chLeafRec(int u, int leaf, F f, Args &&... args) {
    Node &node = nodes[u];
    if (u == leaf) {
      (node.t.*f)(args...);
      return;
    }
    push(u);
    chLeafRec((leaf < node.r) ? node.l : node.r, leaf, f, args...);
    pull(u);
  }

  // Calculates the value for point i.
  T getLeaf(int i) {
    return getLeafRec(0, us[i]);
  }
  T getLeafRec(int u, int leaf) {
    Node &node = nodes[u];
    if (u == leaf) {
      return node.t;
    }
    push(u);
    const T t = getLeafRec((leaf < node.r) ? node.l : node.r, leaf);
    pull(u);
    return t;
  }

  // Applies T::f(args...) to points in [xa, xb] * [ya, yb].
  template <class F, class... Args>
  void ch(X xa, X xb, Y ya, Y yb, F f, Args &&... args) {
    chRec(0, xa, xb, ya, yb, f, args...);
  }
  template <class F, class... Args>
  void chRec(int u, X xa, X xb, Y ya, Y yb, F f, Args &&... args) {
    Node &node = nodes[u];
    if (xb < node.minX || node.maxX < xa || yb < node.minY || node.maxY < ya) {
      return;
    }
    if (xa <= node.minX && node.maxX <= xb && ya <= node.minY && node.maxY <= yb) {
      (node.t.*f)(args...);
      return;
    }
    push(u);
    chRec(node.l, xa, xb, ya, yb, f, args...);
    chRec(node.r, xa, xb, ya, yb, f, args...);
    pull(u);
  }

  // Calculates the product for points in [xa, xb] * [ya, yb].
  T get(X xa, X xb, Y ya, Y yb) {
    return getRec(0, xa, xb, ya, yb);
  }
  T getRec(int u, X xa, X xb, Y ya, Y yb) {
    Node &node = nodes[u];
    if (xb < node.minX || node.maxX < xa || yb < node.minY || node.maxY < ya) {
      return T();
    }
    if (xa <= node.minX && node.maxX <= xb && ya <= node.minY && node.maxY <= yb) {
      return node.t;
    }
    push(u);
    const T tL = getRec(node.l, xa, xb, ya, yb);
    const T tR = getRec(node.r, xa, xb, ya, yb);
    pull(u);
    T t;
    t.pull(tL, tR);
    return t;
  }
};

////////////////////////////////////////////////////////////////////////////////


template <class T> struct NodeSum {
  int sz;
  T sum;
  T lz;
  NodeSum() : sz(0), sum(0), lz(0) {}
  NodeSum(const T &val) : sz(1), sum(val), lz(0) {}
  void push(NodeSum &l, NodeSum &r) {
    l.add(lz);
    r.add(lz);
    lz = 0;
  }
  void pull(const NodeSum &l, const NodeSum &r) {
    sz = l.sz + r.sz;
    sum = l.sum + r.sum;
  }
  void add(const T &val) {
    sum += val * sz;
    lz += val;
  }
  T getSum() const {
    return sum;
  }
  bool accSum(T &acc, const T &tar) const {
    if (acc + sum >= tar) return true;
    acc += sum;
    return false;
  }
};


using Mint = unsigned long long;

int N, Q;
vector<Mint> C;
vector<int> A[2], B[2];
vector<int> X, Y;
vector<Mint> K;

Hld hld[2];


namespace subA {
int L, E;
vector<Mint> giant, baby;
Mint get(int u) {
  const int a = hld[0].dis[u];
  return C[u] + giant[a >> E] + baby[a];
}
vector<Mint> run() {
cerr<<"[subA::run]"<<endl;
  for (E = 0; 1 << (2 * E) < N; ++E) {}
  L = N >> E;
  giant.assign(L + 1, 0ULL);
  baby.assign(N, 0ULL);
  vector<Mint> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    hld[0].doPath(X[q], Y[q], true, [&](int l, int r) -> void {
      for (int x = l >> E; x < r >> E; ++x) giant[x] += K[q];
      for (int i = l >> E << E; i < l; ++i) baby[i] -= K[q];
      for (int i = r >> E << E; i < r; ++i) baby[i] += K[q];
    });
    {
      int x = X[q], y = Y[q];
      for (; hld[1].dep[x] > hld[1].dep[y]; x = hld[1].par[x]) ans[q] += get(x);
      for (; hld[1].dep[x] < hld[1].dep[y]; y = hld[1].par[y]) ans[q] += get(y);
      for (; x != y; x = hld[1].par[x], y = hld[1].par[y]) ans[q] += get(x) + get(y);
      ans[q] += get(x);
    }
  }
  return ans;
}
}  // subA

namespace subB {
vector<vector<int>> graph[2];
vector<int> D[2];
void dfs(int h, int u, int p, int d) {
  D[h][u] = d;
  for (const int v : graph[h][u]) if (p != v) {
    dfs(h, v, u, d + 1);
  }
}

bool check() {
  for (int h = 0; h < 2; ++h) {
    graph[h].assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[h][A[h][i]].push_back(B[h][i]);
      graph[h][B[h][i]].push_back(A[h][i]);
    }
    int cnt = 0;
    for (int u = 0; u < N; ++u) if (graph[h][u].size() <= 1) ++cnt;
    if (cnt > 2) return false;
  }
  return true;
}
vector<Mint> run() {
cerr<<"[subB::run]"<<endl;
  for (int h = 0; h < 2; ++h) {
    D[h].assign(N, -1);
    for (int u = 0; u < N; ++u) if (graph[h][u].size() <= 1) {
      dfs(h, u, -1, 0);
      break;
    }
// cerr<<"D["<<h<<"] = "<<D[h]<<endl;
  }
  KdTree<int, int, NodeSum<Mint>> kdt;
  for (int u = 0; u < N; ++u) kdt.add(D[0][u], D[1][u]);
  kdt.build();
  for (int u = 0; u < N; ++u) kdt.at(u) = C[u];
  kdt.pullAll();
  vector<Mint> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    {
      int a = D[0][X[q]];
      int b = D[0][Y[q]];
      if (a > b) swap(a, b);
      kdt.ch(a, b, 0, N - 1, &NodeSum<Mint>::add, K[q]);
    }
    {
      int a = D[1][X[q]];
      int b = D[1][Y[q]];
      if (a > b) swap(a, b);
      ans[q] = kdt.get(0, N - 1, a, b).sum;
    }
  }
  return ans;
}
}  // subB


int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    C.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%llu", &C[u]);
    }
    for (int h = 0; h < 2; ++h) {
      A[h].resize(N - 1);
      B[h].resize(N - 1);
      for (int i = 0; i < N - 1; ++i) {
        scanf("%d%d", &A[h][i], &B[h][i]);
        --A[h][i];
        --B[h][i];
      }
    }
    X.resize(Q);
    Y.resize(Q);
    K.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%llu", &X[q], &Y[q], &K[q]);
      --X[q];
      --Y[q];
    }
    
    for (int h = 0; h < 2; ++h) {
      hld[h] = Hld(N);
      for (int i = 0; i < N - 1; ++i) {
        hld[h].ae(A[h][i], B[h][i]);
      }
      hld[h].build(0);
    }
    
    vector<Mint> ans;
    if (subB::check()) {
      ans = subB::run();
    } else {
      ans = subA::run();
    }
    for (int q = 0; q < Q; ++q) {
      printf("%llu\n", ans[q]);
    }
  }
  return 0;
}