#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

#define FOR(i, a, b)    for (int i = (a); i < (b); i++)
#define F0R(i, a)       for (int i = 0; i < (a); i++)
#define FORd(i, a, b)   for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i, a)      for (int i = (a)-1; i >= 0; i--)
#define trav(a, x)      for (auto& a : x)

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;

template<typename T> void ckmin(T& a, const T& b) { a = min(a, b); }
template<typename T> void ckmax(T& a, const T& b) { a = max(a, b); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

namespace __input {
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace __input;

namespace __output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps();
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...);
    }
}
using namespace __output;

/*
 * Supports O(logN) lowest common ancestor queries on an immutable tree.
 */
struct edge { int v, w, e, c; };
struct lowest_common_ancestor_log {
    int L, N;
    vi depth, link, edist;
    vll wdist;

    lowest_common_ancestor_log() { }

    lowest_common_ancestor_log(const vector<vector<edge>> &graph, int root = 0) : N(graph.size()) {
        L = 32 - __builtin_clz(N);
        depth.resize(N);
        link.resize(L*N);
        edist.resize(N);
        wdist.resize(N);
        init(root, root, graph);
    }

    /*
     * Initializes the link table in O(NlogN). link[l * N + i] contains the index
     * of the (2 ** l)th ancestor of vertex i.
     */
    void init(int loc, int par, const vector<vector<edge>> &graph) {
        link[loc] = par;
        for (int l = 1; l < L; l++)
            link[l*N + loc] = link[(l-1)*N + link[(l-1)*N + loc]];

        for (auto nbr : graph[loc]) if (nbr.v != par) {
            depth[nbr.v] = depth[loc] + 1;
            wdist[nbr.v] = wdist[loc] + (nbr.e ? nbr.w : 0);
            edist[nbr.v] = edist[loc] + nbr.e;
            init(nbr.v, loc, graph);
        }
    }

    // Returns the index of the dist-th ancestor of vertex loc in O(logN).
    int above(int loc, int dist) {
        dist = min(dist, N - 1);
        for (int l = 0; l < L; l++)
            if (dist & (1 << l))
                loc = link[l*N + loc];
        return loc;
    }

    // Returns the least common ancestor of vertices u and v in O(logN).
    int lca(int u, int v) {
        if (depth[u] > depth[v]) swap(u, v);
        v = above(v, depth[v] - depth[u]);
        if (u == v) return u;

        for (int l = L - 1; l >= 0; l--) {
            if (link[l*N + u] != link[l*N + v])
                u = link[l*N + u], v = link[l*N + v];
        }
        return link[u];
    }

    int dist(int u, int v) {
        return depth[u] + depth[v] - 2 * depth[lca(u, v)];
    }

    ll weighted_dist(int u, int v) {
        return wdist[u] + wdist[v] - 2 * wdist[lca(u, v)];
    }

    int activated_edges(int u, int v) {
        return edist[u] + edist[v] - 2 * edist[lca(u, v)];
    }

    bool on_path(int u, int v, int inx) {
        return dist(u, v) == dist(u, inx) + dist(inx, v);
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int N, Q; re(N, Q);

    vector<vector<edge>> adj(N);

    vvi celts(N);
    struct inp { int u, v, c, w; };
    vector<inp> origEdges(N - 1);

    F0R (i, N - 1) {
        int a, b, c, d; re(a, b, c, d); --a, --b; --c;
        adj[a].pb({ b, d, true, c });
        adj[b].pb({ a, d, true, c });

        celts[c].pb(i);
        origEdges[i] = inp{ a, b, c, d };
    }

    lowest_common_ancestor_log lcaOrig(adj);
    vector<lowest_common_ancestor_log> lcaColor(N);

    const int H = sqrt(N);
    F0R (i, N) if (sz(celts[i]) >= H) {
        F0R (j, N) trav(e, adj[j]) e.e = e.c == i;
        lcaColor[i] = lowest_common_ancestor_log(adj);
    }

    F0R (q, Q) {
        int x, y, u, v; re(x, y, u, v); --x; --u, --v;
        ll dist = lcaOrig.weighted_dist(u, v);
        if (sz(celts[x]) >= H) {
            dist += lcaColor[x].activated_edges(u, v) * ll(y)
                - lcaColor[x].weighted_dist(u, v);
        } else {
            for (int ei : celts[x]) {
                auto& e = origEdges[ei];
                if (lcaOrig.on_path(u, v, e.u) && lcaOrig.on_path(u, v, e.v))
                    dist += y - e.w;
            }
        }
        ps(dist);
    }

    return 0;
}



Measured memory_bytes: 80768