#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
const int N=4e5+5;
const int K=700;
const int M=N/K+5;
int n,m;
ull a[N];
int cn1,cn2;
int tp1[N],tp2[N];
int in1[N],out1[N],in2[N],out2[N];
vector<int> e1[N],e2[N];
int d1[N],d2[N];
int f1[N][20];
int f2[N][20];
ull val[N];
ull tag[M];
ull cn[M][M];
ull s[M];
int kid[N];
int B;
int l[M],r[M];
void dfs1(int no,int fa){
    d1[no]=d1[fa]+1;
    f1[no][0]=fa;
    for(int i=1;i<20;++i)f1[no][i]=f1[f1[no][i-1]][i-1];
    in1[no]=++cn1;
    tp1[cn1]=no;
    for(int to:e1[no]){
        if(to==fa)continue;
        dfs1(to,no);
    }
    out1[no]=++cn1;
    tp1[cn1]=-no;
}
void dfs2(int no,int fa){
    d2[no]=d2[fa]+1;
    f2[no][0]=fa;
    for(int i=1;i<20;++i)f2[no][i]=f2[f2[no][i-1]][i-1];
    in2[no]=++cn2;
    tp2[cn2]=no;
    for(int to:e2[no]){
        if(to==fa)continue;
        dfs2(to,no);
    }
    out2[no]=++cn2;
    tp2[cn2]=-no;
}
int lca1(int x,int y){
    if(d1[x]<d1[y])swap(x,y);
    for(int i=19;i>=0;--i){
        if(d1[f1[x][i]]>=d1[y])x=f1[x][i];
    }
    if(x==y)return x;
    for(int i=19;i>=0;--i){
        if(f1[x][i]!=f1[y][i]){
            x=f1[x][i];
            y=f1[y][i];
        }
    }
    return f1[x][0];
}
int lca2(int x,int y){
    if(d2[x]<d2[y])swap(x,y);
    for(int i=19;i>=0;--i){
        if(d2[f2[x][i]]>=d2[y])x=f2[x][i];
    }
    if(x==y)return x;
    for(int i=19;i>=0;--i){
        if(f2[x][i]!=f2[y][i]){
            x=f2[x][i];
            y=f2[y][i];
        }
    }
    return f2[x][0];
}
void add(int x,ull d){
    if(!x)return;
    for(int i=1;i<kid[x];++i){
        tag[i]+=d;
    }
    for(int i=l[kid[x]];i<=x;++i){
        val[i]+=d;
        const int id=(tp1[i]>0?tp1[i]:-tp1[i]);
        if(tp1[i]>0){
            s[kid[in2[id]]]+=d;
            s[kid[out2[id]]]-=d;
        }
        else{
            s[kid[in2[id]]]-=d;
            s[kid[out2[id]]]+=d;
        }
    }
}
ull qu(int x){
    if(!x)return 0;
    ull sum=0;
    for(int i=1;i<kid[x];++i)sum+=s[i];
    for(int i=1;i<=B;++i){
        sum+=tag[i]*cn[kid[x]-1][i];
    }
    for(int i=l[kid[x]];i<=x;++i){
        const int id=(tp2[i]>0?tp2[i]:-tp2[i]);
        if(tp2[i]>0){
            sum+=val[in1[id]]+tag[kid[in1[id]]];
            sum-=val[out1[id]]+tag[kid[out1[id]]];
        }
        else{
            sum-=val[in1[id]]+tag[kid[in1[id]]];
            sum+=val[out1[id]]+tag[kid[out1[id]]];
        }
    }
    return sum;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i){
        scanf("%llu",&a[i]);
    }
    for(int i=1;i<n;++i){
        int u,v;
        scanf("%d%d",&u,&v);
        e1[u].push_back(v);
        e1[v].push_back(u);
    }
    for(int i=1;i<n;++i){
        int u,v;
        scanf("%d%d",&u,&v);
        e2[u].push_back(v);
        e2[v].push_back(u);
    }
    dfs1(1,0);
    dfs2(1,0);
    B=(cn1-1)/K+1;
    for(int i=1;i<=B;++i){
        l[i]=r[i-1]+1;
        r[i]=i*K;
    }
    r[B]=cn1;
    for(int i=1;i<=B;++i){
        for(int j=l[i];j<=r[i];++j){
            kid[j]=i;
        }
    }
    for(int i=1;i<=B;++i){
        for(int j=1;j<=B;++j)cn[i][j]=cn[i-1][j];
        for(int j=l[i];j<=r[i];++j){
            const int id=(tp2[j]>0?tp2[j]:-tp2[j]);
            if(tp2[j]>0){
                cn[i][kid[in1[id]]]++;
                cn[i][kid[out1[id]]]--;
            }
            else{
                cn[i][kid[in1[id]]]--;
                cn[i][kid[out1[id]]]++;
            }
        }
    }
    for(int i=1;i<=n;++i){
        val[in1[i]]=a[i];
        s[kid[in2[i]]]+=a[i];
        s[kid[out2[i]]]-=a[i];
    }
    while(m--){
        int x,y;
        ull k;
        scanf("%d%d%llu",&x,&y,&k);
        int lc=lca1(x,y);
        add(in1[x],k);
        add(in1[y],k);
        add(in1[lc],-k);
        add(in1[f1[lc][0]],-k);
        lc=lca2(x,y);
        printf("%llu\n",qu(in2[x])+qu(in2[y])-qu(in2[lc])-qu(in2[f2[lc][0]]));
    }
    return 0;
}