#pragma GCC optimize(3, "unroll-loops", "no-stack-protector")
#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) { x = min(x, y); }
template <typename T>
inline void chkmax(T &x, T y) { x = max(x, y); }
namespace FastIO
{
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined (_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
    inline char gc() { return getchar(); }
    inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
    INLINE_V constexpr int _READ_SIZE = 1 << 18;
    INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
    inline char gc()
    {
        if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
        {
            _read_ptr = _read_buffer;
            _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
            if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
        }
        return *_read_ptr++;
    }
#else
    INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
    inline char gc() { return *_read_ptr++; }
#endif
    INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
    INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
    inline void pc(char c)
    {
        *_write_ptr++ = c;
        if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
        {
            fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
            _write_ptr = _write_buffer;
        }
    }
    INLINE_V struct _auto_flush
    {
        ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
    }	_auto_flush;
#endif
#ifdef CHK_EOF
    inline bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
    inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
    inline bool _isdigit(char c) { return c & 16; }
    inline bool _isgraph(char c) { return c > 32; }
#endif
    template < class T >
    INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
    template < class T >
    INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
    template < class T >
    INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
    template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
    template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
    template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
    template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
    inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
    inline void read_cstr(char *s)
    {
        char c = gc(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) *s++ = c, c = gc();
        *s = 0;
    }
    inline void read(string &s)
    {
        char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
        while ( _isgraph(c) ) s.push_back(c), c = gc();
    }
#ifdef IN_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void read(T &x)
    {
        char c = gc(); bool f = true; x = 0;
        while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
        if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
        else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void read(T &x)
    {
        char c = gc(); while ( !_isdigit(c) ) c = gc();
        x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
    }
    inline void write(char c) { pc(c); }
    inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
    inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
    template < class T, enable_if_t < _is_signed < T >, int > = 0 >
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
        else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
        while ( digits ) pc(buffer[--digits]);
    }
    template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
    template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
    inline void write(T x)
    {
        char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
        do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
        while ( digits ) pc(buffer[--digits]);
    }
    template < int N > struct _tuple_io_helper
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x)
        { _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
    };
    template <> struct _tuple_io_helper < 1 >
    {
        template < class ...T >
        static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
        template < class ...T >
        static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
    };
    template < class ...T >
    inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
    template < class ...T >
    inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
    template < class T1, class T2 >
    inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
    template < class T1, class T2 >
    inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
    template < class T1, class ...T2 >
    inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
    template < class ...T >
    inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
    template < class T1, class ...T2 >
    inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
    template < class ...T >
    inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
    template < class T >
    inline void print(const T &x) { write(x); }
    inline void print_cstr(const char *x) { write_cstr(x); }
    template < class T1, class ...T2 >
    inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
    template < class ...T >
    inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
    inline void println() { pc(10); }
    inline void println_cstr() { pc(10); }
    template < class ...T >
    inline void println(const T &...x) { print(x...), pc(10); }
    template < class ...T >
    inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
const int N = 2e5 + 10, C = 35;
int n, m, cc;
ull a[N], ans[N];
struct Tree{
basic_string<int> vec[N];
int top[N], son[N], siz[N], dfn[N], dfncnt, fa[N], dep[N], id[N];
ull qwq[N];
void dfs(int u) {
    qwq[u] += a[u];
    siz[u] = 1;
    for (int v : vec[u])
        if (v != fa[u]) {
            qwq[v] = qwq[u];
            fa[v] = u, dep[v] = dep[u] + 1, dfs(v), siz[u] += siz[v];
            if (siz[v] > siz[son[u]]) son[u] = v;
        }
}
void dfs2(int u) {
    id[dfn[u] = ++dfncnt] = u;
    if (son[u]) top[son[u]] = top[u], dfs2(son[u]);
    for (int v : vec[u])
        if (v != fa[u] && v != son[u]) dfs2(top[v] = v);
}
inline int lca(int u, int v) {
    while (top[u] != top[v]) dep[top[u]] > dep[top[v]] ? u = fa[top[u]] : v = fa[top[v]];
    return dep[u] < dep[v] ? u : v; 
}
inline int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }
inline ull val(int u, int v) { return qwq[u] + qwq[v] - qwq[lca(u, v)] - qwq[fa[lca(u, v)]]; }
} T1, T2;
int B;
int pos[N];
struct Block2 {
    ull val[N], res[N];
    inline void clr() { memset(val, 0, sizeof(val)), memset(res, 0, sizeof(res)); }
    inline ull query(int c) { return val[c] + res[pos[c] - 1]; }
    inline ull query(int l, int r) { return query(r) - query(l - 1); }
    inline void update(int u, ull v) {
        for (int c = pos[u]; c <= pos[n]; c++) res[c] += v;
        for (int c = u; pos[c] == pos[u]; c++) val[c] += v;
    } 
} B2;
int type[N * C], ql[N * C], qr[N * C];
ull qaq[N * C];
inline void update(int u, int v, ull k) {
    while (T1.top[u] != T1.top[v]) {
        if (T1.dep[T1.top[u]] < T1.dep[T1.top[v]]) swap(u, v);
        ++cc, ql[cc] = T1.dfn[T1.top[u]], qr[cc] = T1.dfn[u], qaq[cc] = k, u = T1.fa[T1.top[u]];
    }
    if (T1.dfn[u] > T1.dfn[v]) swap(u, v);
    ++cc, ql[cc] = T1.dfn[u], qr[cc] = T1.dfn[v], qaq[cc] = k;
}
inline void query(int u, int v, int id) {
    while (T2.top[u] != T2.top[v]) {
        if (T2.dep[T2.top[u]] < T2.dep[T2.top[v]]) swap(u, v);
        ++cc, type[cc] = id, ql[cc] = T2.dfn[T2.top[u]], qr[cc] = T2.dfn[u], u = T2.fa[T2.top[u]];
    }
    if (T2.dfn[u] > T2.dfn[v]) swap(u, v);
    ++cc, ql[cc] = T2.dfn[u], qr[cc] = T2.dfn[v], type[cc] = id;
}
ull tag;
int cnt[N];
inline void solve(int L, int R) {
    tag = 0;
    B2.clr();
    memset(cnt, 0, sizeof(cnt));
    for (int i = L; i <= R; i++) ++cnt[T2.dfn[T1.id[i]]];
    for (int i = 1; i <= n;i ++) cnt[i] += cnt[i - 1];
    for (int i = 1; i <= cc; i++)
        if (type[i]) {
            ans[type[i]] += (cnt[qr[i]] - cnt[ql[i] - 1]) * tag;
            ans[type[i]] += B2.query(ql[i], qr[i]);
        } else {
            if (L > qr[i] || R < ql[i]) continue;
            if (L >= ql[i] && R <= qr[i]) tag += qaq[i];
            else {
                for (int c = max(L, ql[i]); c <= min(R, qr[i]); c++) B2.update(T2.dfn[T1.id[c]], qaq[i]);
            }
        }
}
int main() {
    read(n, m);
    B = sqrt(n);
    for (int i = 1; i <= n; i++) read(a[i]), pos[i] = (i - 1) / B + 1;
    for (int i = 1; i < n; i++) {
        int u, v;
        read(u, v), T1.vec[u].push_back(v), T1.vec[v].push_back(u);
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        read(u, v), T2.vec[u].push_back(v), T2.vec[v].push_back(u);
    }
    T1.dfs(1), T2.dfs(1);
    T1.dfs2(T1.top[1] = 1), T2.dfs2(T2.top[1] = 1);
    for (int i = 1; i <= m; i++) {
        int x, y;
        ull k;
        read(x, y, k);
        ans[i] = T2.val(x, y);
        update(x, y, k), query(x, y, i);
    }
    for (int l = 1, r; l <= n; l = r + 1) {
        r = min(l + B - 1, n);
        solve(l, r);
    }
    for (int i = 1; i <= m; i++) println(ans[i]);
    return 0;
}