#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e15;
const int N = 2e5;
inline int read() {
    int s = 0,f = 1;char ch = getchar();
    while (!isdigit(ch)) f = ch == '-' ? -1 : 1, ch = getchar();
    while (isdigit(ch)) s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
    return s*f;
}
/*
1：u，v在同一子树
此时，其中一个可以往上走到某个直径端点，另一个走到lca往下一个儿子的子树直径的一个端点
2：u，v在不同子树
此时，第一类：分别走到离自己近的直径端点
第二类：往中间走，各自找到一个位置进入子树。
贡献如何统计？
假设选了 j,k(u<j<k<v)
贡献为：(d[u]+(s[j]-s[u])+mxd[j])A+(d[v]+(s[v]-s[k])+mxd[k])B
求max{(s[j]+mxd[j])A+(-s[k]+mxd[k])B},j<k 
*/
int n,q,head[N + 10],cnt;
struct edge {
    int v,w,nxt;
}ed[N * 2 + 10];
void add(int u,int v,int w) {
    ed[++cnt] = {v,w,head[u]};
    head[u] = cnt;
}
int dep[N + 10],fa[N + 10],sz[N + 10],son[N + 10],top[N + 10],id[N + 10],tot,rnk[N + 10];
int dd[N + 10];
int mx,Id,rt1,rt2,fl,ct,st[N + 10],ind[N + 10];
void dfs(int x,int f) {
    fa[x] = f, dep[x] = dep[f] + 1, sz[x] = 1;
    for (int i = head[x];i;i = ed[i].nxt) {
        int v = ed[i].v;
        if (v == f || ind[v]) continue;
        dd[v] = dd[x] + ed[i].w;
        dfs(v,x);
        sz[x] += sz[v];
        if (sz[son[x]] < sz[v]) son[x] = v;
    }
}
int LCA(int x,int y) {
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) swap(x,y);
        x = fa[top[x]];
    }
    return dep[x] < dep[y] ? x : y;
}
int dis(int x,int y) {
    int lca = LCA(x,y);
    return dd[x] + dd[y] - 2 * dd[lca];
}
struct dia {
    int x,y,d;
    bool operator < (const dia &a) const {
        return d < a.d;
    }
    friend dia operator + (dia x,dia y) {
        return max({x,y,{x.x,y.x,dis(x.x,y.x)},{x.x,y.y,dis(x.x,y.y)},{x.y,y.x,dis(x.y,y.x)},{x.y,y.y,dis(x.y,y.y)}});
    }
}di[N + 10];
void dfs2(int x,int tp) {
    top[x] = tp, id[x] = ++tot, rnk[tot] = x;
    if (!son[x]) return;
    dfs2(son[x],tp);
    for (int i = head[x];i;i = ed[i].nxt) {
        int v = ed[i].v;
        if (v == fa[x] || v == son[x] || ind[v]) continue;
        dfs2(v,v);
    }
}
void dfs3(int x,int fa,int d) {
    if (d > mx) mx = d, Id = x;
    for (int i = head[x];i;i = ed[i].nxt) {
        int v = ed[i].v;
        if (v != fa) dfs3(v,x,d + ed[i].w);
    }
}
void dfs4(int x,int fa,int y) {
    if (fl) return;
    st[++ct] = x;ind[x] = 1;
    if (x == y) {
        fl = 1;
        return;
    }
    for (int i = head[x];i;i = ed[i].nxt) {
        int v = ed[i].v;
        if (v != fa) dfs4(v,x,y);
    }
    if (!fl) ct --, ind[x] = 0;
}
int getk(int x,int k) {
    if (k < 0) return -1;
    while (k >= id[x] - id[top[x]] + 1) {
        k -= id[x] - id[top[x]] + 1;
        x = fa[top[x]];
    }
    return rnk[id[x] - k];
}
int to[N + 10],s[N + 10],mxd[N + 10];
void dfs5(int x,int rt) {
    di[x] = {x,x,0};
    to[x] = rt;
    mxd[rt] = max(mxd[rt],dd[x]);
    for (int i = head[x];i;i = ed[i].nxt) {
        int v = ed[i].v;
        if (v == fa[x] || ind[v]) continue;
        dfs5(v,rt);
        di[x] = di[x] + di[v];
    }
}
map<pair<int,int>,int> mp;
int pre[N + 10],suf[N + 10];
int tp;
struct vec {
    ll x,y;
    vec(){}
    vec(ll X,ll Y) {x = X, y = Y;}
    vec operator + (vec a) {return vec(x+a.x,y+a.y);}
    vec operator - (vec a) {return vec(x-a.x,y-a.y);}
    vec operator * (double a) {return vec(x*a,y*a);}
    friend ll cross(vec x,vec y) {return 1ll * x.x * y.y - 1ll * x.y * y.x;}
}a[N + 10],b[N + 10];
int cmp(vec x,vec y) {
    return x.x == y.x ? x.y < y.y : x.x < y.x;
}
ll calc(vec x,vec y,vec k) {
    return cross(y-x,k-x);
}
struct Seg {
    int l,r;
    vector<vec> vc;
}t[N * 4 + 10];
void build(int x,int l,int r) {
    t[x].l = l, t[x].r = r;
    for (int i = l;i <= r;i ++ ) b[i] = a[i];
    sort(b + l + 1,b + r + 1,cmp);
    for (int i = l;i <= r;i ++ ) {
        while (t[x].vc.size() > 1 && calc(t[x].vc[t[x].vc.size() - 2],t[x].vc.back(),b[i]) >= 0) t[x].vc.pop_back();
        t[x].vc.push_back(b[i]);
    }
    t[x].vc.push_back({0,0});
    if (l == r) return;
    int mid = l + r >> 1;
    build(x<<1,l,mid), build(x<<1|1,mid + 1,r);
}
ll query(int x,int l,int r,ll A,ll B,int u,int v) {
    if (l > r) return 0;
    if (t[x].l >= l && r >= t[x].r) {
        int l = 0,r = t[x].vc.size() - 2;
        while (l < r) {
            int mid = l + r >> 1;
            if (t[x].vc[mid].y * B + t[x].vc[mid].x * A >= t[x].vc[mid + 1].y * B + t[x].vc[mid + 1].x * A) r = mid;
            else l = mid + 1;
        }
        return A * (dd[u] - s[to[u]]) + B * (dd[v] + s[to[v]]) + t[x].vc[l].y * B + t[x].vc[l].x * A;
    }
    int mid = t[x].l + t[x].r >> 1;
    ll res = 0;
    if (mid >= l) res = query(x<<1,l,r,A,B,u,v);
    if (mid < r) res = max(res,query(x<<1|1,l,r,A,B,u,v));
    return res;
}
signed main() {
    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);
        mp[{u,v}] = mp[{v,u}] = w;
    }
    dfs3(1,0,0);mx = 0, rt1 = Id, dfs3(rt1,0,0);
    dfs4(rt1,0,Id);
//  for (int i = 1;i <= ct;i ++ ) cout << st[i] << ' ';puts("");
    for (int i = 1;i <= ct;i ++ ) {
//      cout << "!!" << i << ' ' << s[i] << endl;
        dfs(st[i],0), dfs2(st[i],st[i]);
        dfs5(st[i],i);
        if (i > 1) s[i] = s[i - 1] + mp[{st[i - 1],st[i]}];
        pre[i] = max(pre[i - 1],s[i] + mxd[i]);
    }
//  cout << rt1 << ' ' << Id << endl;
    suf[ct + 1] = -inf;
    for (int i = ct;i;i -- ) suf[i] = max(suf[i + 1],-s[i] + mxd[i]), a[i] = {s[i] + mxd[i],suf[i + 1]};
    build(1,1,ct);
    while (q -- ) {
        int u = read(),v = read();
        ll A = read(),B = read();
        if (to[u] > to[v]) swap(u,v), swap(A,B);
        ll ans = 0;
        if (to[u] == to[v]) {
            int lca = LCA(u,v);
            int uk = getk(u,dep[u] - dep[lca] - 1),vk = getk(v,dep[v] - dep[lca] - 1);
            if (uk != -1) ans = max(ans,B * (dd[v] + max(s[ct] - s[to[v]],s[to[v]])) + A * max(dis(u,di[uk].x),dis(u,di[uk].y)));
            if (vk != -1) ans = max(ans,A * (dd[u] + max(s[ct] - s[to[v]],s[to[v]])) + B * max(dis(v,di[vk].x),dis(v,di[vk].y)));
            printf("%lld\n",ans);
        }
        else {
            ans = max(ans,B * (dd[v] + s[ct] - s[to[v]]) + A * (dd[u] + s[to[u]]));
            ans = max(ans,B * (dd[v] + s[ct] - s[to[v]]) + A * (dd[u] - s[to[u]] + pre[to[v] - 1]));
            ans = max(ans,B * (dd[v] + s[to[v]] + suf[to[u] + 1]) + A * (dd[u] + s[to[u]]));
//          cout << "ans:" << ans << endl;
            if (!ind[u]) {
                int uk = getk(u,dep[u] - dep[st[to[u]]] - 1);
                ans = max(ans,B * (dd[v] + s[to[v]]) + A * (max(dis(u,di[uk].x),dis(u,di[uk].y))));
            }
            if (!ind[v]) {
                int vk = getk(v,dep[v] - dep[st[to[v]]] - 1);
                ans = max(ans,A * (dd[u] + s[ct] - s[to[u]]) + B * (max(dis(v,di[vk].x),dis(v,di[vk].y))));
            }
            /*
            x[i]=s[i]+mxd[i]
            y[i]=suf[i+1]
            */
//          int l = to[u] + 1,r = to[v] - 1,fl1 = 0;
//          for (int i = l;i <= r;i ++ ) vv[i] = val(i,A,B), mx =
//          double k = -A * 1.0 / B;
//          while (l < r) {
//              int mid = l + r >> 1;
//              if (mid == to[v] - 1) {
//                  l = mid;
//                  break;
//              }
//              if (val(mid,A,B) == val(mid + 1,A,B)) fl1 ? r = mid : l = mid + 1, fl1 = 0;
//              else if (val(mid,A,B) > val(mid + 1,A,B)) r = mid, fl1 = 1;
//              else l = mid + 1, fl1 = 0;
//          }
            ans = max(ans,query(1,to[u] + 1,to[v] - 1,A,B,u,v));
//          ans = max(ans,A * (dd[u] + s[l] - s[to[u]] + mxd[l]) + B * (dd[v] + s[to[v]] + suf[l + 1]));
//          for (int i = to[u] + 1;i < to[v];i ++ )
//              ans = max(ans,A * (dd[u] + s[i] - s[to[u]] + mxd[i]) + B * (dd[v] + s[to[v]] + suf[i + 1]));
            printf("%lld\n",ans);
        }
    }
    return 0;
}