// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<
// >>> union find
struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { }
    int root(int x) {
        assert(0 <= x && x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x,y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    struct groups_t {
        vector<vector<int> > grp;
        vector<pair<int,int> > id;
    };
    groups_t groups() {
        vector<vector<int> > g(n);
        rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i,n) g[root(i)].push_back(i);
        vector<vector<int> > grp; grp.reserve(size());
        rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i]));
        vector<pair<int,int> > id(n);
        rep (i,grp.size()) rep (j,grp[i].size()) {
            id[grp[i][j]] = make_pair(i,j);
        }
        return { grp, id };
    }
};
// <<<
// >>> offline LCA
constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class E>
vector<int> offline_LCA(vector<vector<E> > const& g,
                        vector<pair<int,int> > const& qs, int root = 0) {
    vector<int32_t> anc(g.size(),-1);
    UnionFind uf(g.size());
    vector<vector<pair<int32_t,int32_t> > > ps(g.size());
    vector<int> ret(qs.size());
    rep (i,qs.size()) {
        int a = qs[i].first, b = qs[i].second;
        ps[a].emplace_back(b,i);
        ps[b].emplace_back(a,i);
    }
    auto dfs = [&](auto &&dfs, int x) -> void {
        anc[x] = x;
        for (auto const& e : g[x]) {
            const int y = dst(e);
            if (anc[y] >= 0) continue;
            dfs(dfs,y);
            uf.unite(x,y);
            anc[uf.root(x)] = x;
        }
        for (auto &p : ps[x]) {
            if (anc[p.first] >= 0) ret[p.second] = anc[uf.root(p.first)];
        }
    };
    dfs(dfs, root);
    return ret;
}
// <<<

int32_t main() {
    int n,q; cin >> n >> q;
    struct edge { int to, color, cost; };
    vector<vector<edge> > g(n);
    rep (i,n-1) {
        int a,b,c,d; cin >> a >> b >> c >> d; a--,b--,c--;
        g[a].pb({b,c,d});
        g[b].pb({a,c,d});
    }
    vector<int> x(q),y(q),u(q),v(q);
    rep (i,q) {
        cin >> x[i] >> y[i] >> u[i] >> v[i];
        x[i]--,u[i]--,v[i]--;
    }

    vector<int> vs(3*q), ans(3*q);
    vector<vector<int> > z(n);
    {
        vector<pair<int,int> > qs(q);
        rep (i,q) qs[i] = mp(u[i],v[i]);
        auto lca = offline_LCA(g,qs);
        rep (i,q) vs[3*i] = u[i], vs[3*i+1] = v[i], vs[3*i+2] = lca[i];
        rep (j,3*q) z[vs[j]].eb(j);
        dump(vs);
    }

    int dep = 0;
    vector<int> c(n-1), d(n-1);
    def (dfs, int xx = 0, int p = -1) -> void {
        for (int j : z[xx]) {
            int i = j/3;
            ans[j] = dep + c[x[i]]*y[i] - d[x[i]];
            dump(xx,j,dep,c[x[i]],y[i],d[x[i]],ans[j]);
        }
        for (auto e : g[xx]) {
            if (e.to == p) continue;
            dep += e.cost; c[e.color]++; d[e.color] += e.cost;
            dfs(e.to, xx);
            dep -= e.cost; c[e.color]--; d[e.color] -= e.cost;
        }
    };
    dfs();
    dump(ans);

    rep (i,q) cout << ans[3*i] + ans[3*i+1] - 2*ans[3*i+2] << "\n";

}


Measured memory_bytes: 39296