using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    int S;
    List<E>[] g;
    List<int>[] qcol;//頂点iで必要とされる色
    Dictionary<int, int>[] dct,dsum;
    int[] colsum, sum, colct;
    int[][] qry;
    public void Solve(Scanner sc)
    {
        int N, Q;
        sc.Make(out N, out Q);
        sum = new int[N];
        colsum = new int[N];
        colct = new int[N];
        g = Create(N, () => new List<E>());
        qcol = Create(N, () => new List<int>());
        qry = new int[Q][];
        var lca = new LowestCommonAncestor(N);
        dct = Create(N, () => new Dictionary<int, int>());
        dsum = Create(N, () => new Dictionary<int, int>());
        for (int i = 0; i < N-1; i++)
        {
            int a, b, c, d;
            sc.Make(out a, out b, out c, out d);
            a--;b--;c--;
            lca.AddEdge(a, b);
            g[a].Add(new E(b, c, d));
            g[b].Add(new E(a, c, d));
        }
        lca.Build();
        for (int i = 0; i < Q; i++)
        {
            int x, y, u, v;
            sc.Make(out x, out y, out u, out v);x--; u--;v--;
            var lc = lca.LCA(u, v);
            qcol[lc].Add(x);qcol[u].Add(x);qcol[v].Add(x);
            qry[i] = new[] { x, y, u, v, lc };
        }
        dfs(0, -1);
        foreach(var a in qry)
        {
            int x = a[0], y = a[1], u = a[2], v = a[3], lc = a[4];
            var res = 0;
            res += sum[u] + sum[v] - 2 * sum[lc];
            res -= dsum[u][x] + dsum[v][x] - 2 * dsum[lc][x];
            res += y * (dct[u][x] + dct[v][x] - 2 * dct[lc][x]);
            WriteLine(res);
        }
    }
    void dfs(int i,int p)
    {
        sum[i] = S;
        foreach(var q in qcol[i])
        {
            dct[i][q] = colct[q];
            dsum[i][q] = colsum[q];
        }
        foreach(var e in g[i])
            if (e.to != p)
            {
                colct[e.col]++;
                colsum[e.col] += e.dist;
                S += e.dist;
                dfs(e.to, i);
                colct[e.col]--;
                colsum[e.col] -= e.dist;
                S -= e.dist;
            }
    }
    struct E
    {
        public int to, col, dist;
        public E(int t,int c,int d)
        {
            to = t;col = c;dist = d;
        }
    }
}

class LowestCommonAncestor
{
    private List<int>[] g;
    private int N, lb;
    private int[][] parent;
    private int[] depth;
    private bool finished;
    public LowestCommonAncestor(int N)
    { this.N = N; g = Create(N, () => new List<int>()); }
    public void AddEdge(int u, int v)
    {
        g[u].Add(v); g[v].Add(u);
    }
    public void Build(int root = 0)
    {
        for (lb = 31; lb >= 0; lb--)
            if ((1 & N >> lb) == 1)
                break;
        parent = Create(lb + 1, () => Create(N, () => -1));
        depth = new int[N];
        var st = new Stack<int>();
        st.Push(-1);
        st.Push(root);
        while (st.Any())
        {
            int i = st.Pop(), p = st.Pop();
            parent[0][i] = p;
            foreach (var e in g[i])
                if (e != p)
                {
                    depth[e] = depth[i] + 1;
                    st.Push(i); st.Push(e);
                }
        }
        for (var i = 1; i <= lb; i++)
            for (var j = 0; j < N; j++)
                if (parent[i - 1][j] != -1)
                {
                    parent[i][j] = parent[i - 1][parent[i - 1][j]];
                }
        finished = true;
    }
    public int LCA(int u, int v)
    {
        if (!finished) throw new Exception("You Need to Execute \"Build()\"");
        if (depth[u] > depth[v])
            swap(ref u, ref v);
        for (var i = lb; i >= 0; i--)
            if ((1 & (depth[v] - depth[u]) >> i) == 1)
                v = parent[i][v];
        if (u == v) return u;
        for (var i = lb; i >= 0; i--)
            if (parent[i][u] != parent[i][v])
            { u = parent[i][u]; v = parent[i][v]; }
        return parent[0][u];
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }

}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion

Measured memory_bytes: 123360