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

#define min(args...) min({args})
#define max(args...) max({args})
#define redirect(filename) freopen(#filename".in", "r", stdin), freopen(#filename".out", "w", stdout)
#define all(container) (container).begin(), (container).end()
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pb push_back
#define eb emplace_back

template<typename t> class gpq : public priority_queue<t, vector<t>, greater<t>> {};
typedef int64_t ll;
typedef uint64_t ull;
#if defined _WIN64 or not defined _WIN32
typedef __int128 i128;
#endif
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const bool MULTIPLE_TESTS = 0;

struct tree{
    vi t[200200];
    int top[200200],fa[200200],siz[200200],son[200200];
    int dfn[200200],cntdfn;
    void addedge(int u,int v){t[u].pb(v),t[v].pb(u);}
    void dfs1(int u){
        siz[u]=1;
        for(int v:t[u])if(v!=fa[u]){
            fa[v]=u,dfs1(v),siz[u]+=siz[v];
            if(siz[son[u]]<siz[v])son[u]=v;
        }
    }
    void dfs2(int u){
        if(u==son[fa[u]])top[u]=top[fa[u]];
        else top[u]=u;
        dfn[u]=++cntdfn;
        if(son[u])dfs2(son[u]);
        for(int v:t[u])if(v!=son[u]&&v!=fa[u])dfs2(v);
    }
    void init(){dfs1(1),dfs2(1);}
    vector<pii>getjzc(int u,int v){
        vector<pii>res;
        while(top[u]!=top[v]){
            if(dfn[fa[top[u]]]>dfn[fa[top[v]]])res.eb(dfn[top[u]],dfn[u]),u=fa[top[u]];
            else res.eb(dfn[top[v]],dfn[v]),v=fa[top[v]];
        }
        res.eb(min(dfn[u],dfn[v]),max(dfn[u],dfn[v]));
        return res;
    }
}T1,T2;
const int B=500;
int n,m;
int lp[1000],rp[1000],bid[200200];
int p[200200],pp[200200];
int to[1000][1000];
ull tag[1000];
ull aa[200200],a[200200];
ull sm[1000];
void modify(int x,int l,int r,ull v){
    for(int i=lp[x];i<=rp[x];i++)if(l<=i&&i<=r)a[i]+=v,sm[bid[p[i]]]+=v;
}
ull query(int x,int l,int r){
    if(l<=lp[x]&&rp[x]<=r)return sm[x];
    ull sm=0;
    for(int i=lp[x];i<=rp[x];i++)if(l<=i&&i<=r)sm+=a[pp[i]]+tag[bid[pp[i]]];
    return sm;
}
void solve(int _Tid) {
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>aa[i];
    for(int i=1;i<=n;i++)bid[i]=(i-1)/B+1,lp[bid[i]]=lp[bid[i]]?lp[bid[i]]:i,rp[bid[i]]=i;
    for(int i=1,u,v;i<n;i++)cin>>u>>v,T1.addedge(u,v);
    for(int i=1,u,v;i<n;i++)cin>>u>>v,T2.addedge(u,v);
    T1.init(),T2.init();
    for(int i=1;i<=n;i++)p[T1.dfn[i]]=T2.dfn[i],pp[T2.dfn[i]]=T1.dfn[i],a[T1.dfn[i]]=aa[i];
    for(int i=1;i<=n;i++)sm[bid[p[i]]]+=a[i];
    for(int i=1;i<=n;i++)to[bid[i]][bid[p[i]]]++;
    for(int i=1;i<=bid[n];i++)for(int j=1;j<=bid[n];j++)to[i][j]+=to[i-1][j];
    for(int i=1;i<=m;i++){
        int x,y;ull z;
        cin>>x>>y>>z;
        auto d=T1.getjzc(x,y);
        for(auto[l,r]:d){
            modify(bid[l],l,r,z);
            if(bid[r]==bid[l])continue;
            modify(bid[r],l,r,z);
            for(int i=bid[l]+1;i<bid[r];i++)tag[i]+=z;
            for(int i=1;i<=bid[n];i++)sm[i]+=(to[bid[r]-1][i]-to[bid[l]][i])*z;
        }
        d=T2.getjzc(x,y);
        ull ans=0;
        for(auto[l,r]:d)for(int i=bid[l];i<=bid[r];i++)ans+=query(i,l,r);
        cout<<ans<<'\n';
    }
}

signed main() {
    fastio;
    auto _Tbe = chrono::steady_clock::now();
    int T = 1;
    if (MULTIPLE_TESTS) cin >> T;
    for (int _ = 1; _ <= T; _++) solve(_);
    auto _Ted = chrono::steady_clock::now();
    cerr<<"Used time: "<<chrono::duration_cast<chrono::milliseconds>(_Ted - _Tbe).count()<<"ms\n";
    return 0;
}