#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
    int len=0;
    char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
    #if ONLINE_JUDGE
    #define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
    #else
    #define gh() getchar()
    #endif
    #define reg register
    inline int read(){
        reg char ch=gh();
        reg int x=0;
        reg char t=0;
        while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
        while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
        return t?-x:x;
    }
    inline void putc(char ch){
        out[len++]=ch;
    }
    template<class T>
    inline void write(T x){
        if(x<0)putc('-'),x=-x;
        if(x>9)write(x/10);
        out[len++]=x%10+48;
    }
    inline void flush(){
        fwrite(out,1,len,stdout);
        len=0;
    }
    inline char getc(){
        char ch=gh();
        while(ch<'A'||ch>'Z') ch=gh();
        return ch;
    }
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=2e5+10,Q=5e5+10;
int n,q,X,Y,head[N],fa[N],cnt;
ll dep[N],ans[Q],mx[N];
bool vis[N];
struct Edge{
    int to,nxt,w;
}a[N<<1];
inline void add(int u,int v,int w){
    a[++cnt]={v,head[u],w};
    head[u]=cnt;
}
struct Query{
    int u,v,a,b;
}qr[Q];
inline void dfs0(int x,int fa){
    for(int i=head[x];i;i=a[i].nxt){
        int t=a[i].to;
        if(t==fa) continue;
        dep[t]=dep[x]+a[i].w;
        dfs0(t,x);
    }
}
namespace ST{
    int dfn[N],lg[N],tim,st[19][N];
    vector<pii>son[N];
    inline void dfs(int x,int f){
        st[0][dfn[x]=++tim]=f;
        mx[x]=dep[x];
        for(int i=head[x];i;i=a[i].nxt){
            int t=a[i].to;
            if(t==f) continue;
            dep[t]=dep[x]+a[i].w,fa[t]=x;
            dfs(t,x);
            mx[x]=max(mx[x],mx[t]);
            son[x].push_back(mpr(dfn[t],t));
        }
    }
    inline int cmp(int x,int y){
        return dep[x]<dep[y]?x:y;
    }
    inline int LCA(int x,int y){
        if(x==y) return x;
        x=dfn[x],y=dfn[y];
        if(x>y) swap(x,y);
        x++;
        int i=lg[y-x+1],p=1<<i;
        return cmp(st[i][x],st[i][y-p+1]);
    }
    inline ll dis(int u,int v){
        return dep[u]+dep[v]-dep[LCA(u,v)]*2;
    }
    inline int find(int x,int y){
        return (*(--upper_bound(son[x].begin(),son[x].end(),mpr(dfn[y],N)))).sec;
    }
    struct Line{
        int a,b;
        Line(int x=0,int y=0){ a=x,b=y; }
        inline friend bool operator<(const Line &a,const Line &b){
            return dis(a.a,a.b)<dis(b.a,b.b);
        }
        inline friend Line operator+(const Line &a,const Line &b){
            return max({a,b,Line(a.a,b.a),Line(a.a,b.b),Line(a.b,b.a),Line(a.b,b.b)});
        }
    }s[N];
    inline void dfs2(int x,int f){
        s[x]=Line(x,x);
        for(int i=head[x];i;i=a[i].nxt){
            int t=a[i].to;
            if(t==f) continue;
            dfs2(t,x);
            s[x]=s[x]+s[t];
        }
    }
    inline void init(int x){
        dep[x]=fa[x]=tim=0;
        for(int i=1;i<=n;i++)
            son[i].clear();
        dfs(x,0);
        for(int i=1;(1<<i)<=n;i++)
            for(int j=1;j+(1<<i)-1<=n;j++)
                st[i][j]=cmp(st[i-1][j],st[i-1][j+(1<<i-1)]);
        for(int i=2;i<=n;i++)
            lg[i]=lg[i>>1]+1;
        dfs2(x,0);
    }
}
using ST::find;
using ST::init;
using ST::Line;
using ST::LCA;
using ST::dis;
int id[N];
ll pr[N],sf[N],prs[N],sfs[N],pmx[N];
inline void dfs(int x,int fa){
    for(int i=head[x];i;i=a[i].nxt){
        int t=a[i].to;
        if(t==fa) continue;
        id[t]=id[x];
        dfs(t,x);
    } 
}
int main(){
//  freopen("path1.in","r",stdin);
//  freopen("path1.ans","w",stdout);
    srand(time(0));
    n=read(),q=read();
    for(int i=1;i<n;i++){
        int u=read(),v=read(),w=read();
        add(u,v,w),add(v,u,w);
    }
    for(int i=1;i<=q;i++){
        int u=read(),v=read(),A=read(),B=read();
        qr[i]={u,v,A,B};
    }
    dfs0(1,0);
    ll mxd=0;
    for(int i=1;i<=n;i++)
        if(dep[i]>mxd) mxd=dep[i],X=i;
    dep[X]=mxd=0;
    dfs0(X,0);
    for(int i=1;i<=n;i++)
        if(dep[i]>mxd) mxd=dep[i],Y=i;
    init(X);
    for(int i=1;i<=q;i++){
        int u=qr[i].u,v=qr[i].v,a=qr[i].a,b=qr[i].b;
        int l=LCA(u,v);
        if(l!=v){
            Line tmp=ST::s[find(l,v)];
            ans[i]=max(ans[i],a*dep[u]+b*max(dis(v,tmp.a),dis(v,tmp.b)));
        }
        if(l!=u){
            Line tmp=ST::s[find(l,u)];
            ans[i]=max(ans[i],b*dep[v]+a*max(dis(u,tmp.a),dis(u,tmp.b)));
        }
    }
    init(Y);
    for(int i=1;i<=q;i++){
        int u=qr[i].u,v=qr[i].v,a=qr[i].a,b=qr[i].b;
        int l=LCA(u,v);
        if(l!=v){
            Line tmp=ST::s[find(l,v)];
            ans[i]=max(ans[i],a*dep[u]+b*max(dis(v,tmp.a),dis(v,tmp.b)));
        }
        if(l!=u){
            Line tmp=ST::s[find(l,u)];
            ans[i]=max(ans[i],b*dep[v]+a*max(dis(u,tmp.a),dis(u,tmp.b)));
        }
    }
    vector<int>vec;
    vec.push_back(0);
    for(int i=X;i;i=fa[i])
        vec.push_back(i),vis[i]=1,id[i]=vec.size()-1;
    if(vec.size()<n){
        for(int i=1;i<vec.size();i++){
            ll v=0;
            for(int j=head[vec[i]];j;j=a[j].nxt){
                int t=a[j].to;
                if(vis[t]) continue;
                v=max(v,mx[t]-dep[vec[i]]);
                id[t]=i,dfs(t,vec[i]);
            }
            pr[i]=dep[X]-dep[vec[i]]+v,sf[i]=dep[vec[i]]+v;
            prs[i]=dep[X]-dep[vec[i]],sfs[i]=dep[vec[i]];
        }
        for(int i=1;i<=q;i++){
            int u=qr[i].u,v=qr[i].v,a=qr[i].a,b=qr[i].b;
            if(id[u]>id[v]) swap(u,v),swap(a,b);
            int l=id[u]+1,r=id[v]-1;
            if(l<r){
                ll mx=0;
                pmx[l-1]=0;
                for(int j=l;j<=r;j++)
                    pmx[j]=max(pmx[j-1],pr[j]);
                for(int k=l+1;k<=r;k++)
                    mx=max(mx,a*pmx[k-1]+b*sf[k]);
                ans[i]=max(ans[i],mx+a*(dep[u]-dep[X])+b*(dep[v]-dep[vec[r+1]]*2));
            }
        }
    }
    for(int i=1;i<=q;i++)
        write(ans[i]),putc('\n');
    flush();
}