#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("arch=skylake-avx512")

#pragma region template

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define num(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
    ll a, b;
    is >> a >> b;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb(b);
    if (__DIRECTED__ == false) g[b].pb(a);
    return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
    ll a, b;
    T c;
    is >> a >> b >> c;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb({b, c});
    if (__DIRECTED__ == false) g[b].pb({a, c});
    return is;
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                                                 \
    {                                                                                              \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                                         \
        for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] ";                               \
        cerr << rt;                                                                                \
    }

#define dump(a, h, w)                                                                              \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                                            \
        rep(__i, h) {                                                                              \
            rep(__j, w) {                                                                          \
                if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-';          \
                if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp;                                \
                else                                                                               \
                    cerr << a[__i][__j] << sp;                                                     \
            }                                                                                      \
            cerr << rt;                                                                            \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

#define vdump(a, n)                                                                                \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [";                                                  \
        rep(__i, n) {                                                                              \
            if (__i) cerr << sp;                                                                   \
            if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-';                        \
            if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp;                                         \
            else                                                                                   \
                cerr << a[__i];                                                                    \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

#pragma endregion

struct LCA {
    ll n, d = 0, inf = 1000000000;
    vector<ll> dist;
    vector<vector<ll>> root, graph;
    LCA(ll n) : n(n), dist(n, inf), graph(n) {
        ll k = 2 * n;
        while (k /= 2) d++;
        root = vector<vector<ll>>(d, vector<ll>(n, -1));
    }
    void add_edge(ll a, ll b) {
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    void calc() {
        dist[0] = root[0][0] = 0, dfs(0);
        for (ll i = 0; i < d - 1; i++) {
            for (ll j = 0; j < n; j++) {
                if (root[i][j] == -1) continue;
                root[i + 1][j] = root[i][root[i][j]];
            }
        }
    }
    void dfs(ll t) {
        for (ll i : graph[t]) {
            if (dist[i] != inf) continue;
            root[0][i] = t;
            dist[i] = dist[t] + 1;
            dfs(i);
        }
    }
    ll lca(ll a, ll b) {
        if (dist[a] < dist[b]) swap(a, b);
        ll diff = dist[a] - dist[b];
        for (ll i = 0; i < d; i++) {
            if ((1 << i) & diff) a = root[i][a];
        }
        for (ll i = d - 1; i >= 0; i--) {
            if (root[i][a] != root[i][b]) a = root[i][a], b = root[i][b];
        }
        if (a != b) a = root[0][a], b = root[0][b];
        return a;
    }
    ll distance(ll a, ll b) {
        ll par = lca(a, b);
        return dist[a] + dist[b] - 2 * dist[par];
    }
};

signed main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N - 1), B(N - 1), C(N - 1), D(N - 1), X(Q), Y(Q), U(Q), V(Q);
    vector<vector<ll>> G(N);
    LCA lca(N);
    rep(i, N - 1) {
        cin >> A[i] >> B[i] >> C[i] >> D[i];
        A[i]--, B[i]--, C[i]--, G[A[i]].pb(i), G[B[i]].pb(i);
        lca.add_edge(A[i], B[i]);
    }
    lca.calc();

    vector<pvector<ll>> q(N);
    ll d = 0;
    vector<ll> cnt(N - 1), dist(N - 1), res(Q);

    function<void(ll, ll)> dfs = [&](ll v, ll p) {
        for (auto [i, j] : q[v]) {
            if (j == 0) {
                res[i] -= 2 * (d - dist[X[i]] + cnt[X[i]] * Y[i]);
            } else {
                res[i] += d - dist[X[i]] + cnt[X[i]] * Y[i];
            }
        }
        each(i, G[v]) {
            ll u = B[i] == v ? A[i] : B[i];
            if (p == u) continue;
            cnt[C[i]]++;
            dist[C[i]] += D[i];
            d += D[i];
            dfs(u, v);
            cnt[C[i]]--;
            dist[C[i]] -= D[i];
            d -= D[i];
        }
    };

    rep(i, Q) {
        cin >> X[i] >> Y[i] >> U[i] >> V[i];
        X[i]--, U[i]--, V[i]--;
        ll p = lca.lca(U[i], V[i]);
        q[p].eb(i, 0);
        q[U[i]].eb(i, 1);
        q[V[i]].eb(i, 1);
    }
    dfs(0, -1);

    rep(i, Q) cout << res[i] << rt;
}

Measured memory_bytes: 57224