#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

struct HLD {
  vector<vector<int>> g;
  vector<int> vid;
  vector<int> head;
  vector<int> par;
  HLD(vector<vector<int>> g) : g(g) {
    int n = g.size();
    vid = vector<int>(n);
    head = vector<int>(n);
    par = vector<int>(n, -1);
    {
      vector<int> sz(n);
      auto dfs = [&](auto dfs, int u, int p) -> void {
        sz[u] = 1;
        for (auto &v : g[u]) if (v != p) {
          par[v] = u;
          dfs(dfs, v, u);
          sz[u] += sz[v];
          if (sz[v] > sz[g[u][0]]) swap(v, g[u][0]);
        }
      };
      dfs(dfs, 0, -1);
    }
    {
      vector<int> next(n, -1);
      queue<int> q;
      auto dfs = [&](auto dfs, int u, int p) -> void {
        for (auto v : g[u]) if (v != p) {
          if (v == g[u][0]) {
            next[u] = v;
            head[v] = head[u];
          } else {
            q.emplace(v);
            head[v] = v;
          }
          dfs(dfs, v, u);
        }
      };
      auto bfs = [&](int s) {
        int k = 0;
        while (q.size()) {
          int u = q.front(); q.pop();
          for (int v = u; v != -1; v = next[v]) {
            vid[v] = k++;
          }
        }
      };
      q.emplace(0);
      dfs(dfs, 0, -1);
      bfs(0);
    }
  }
  void for_each(int u, int v, function<void(int, int)> f) {
    while (true) {
      if (vid[u] > vid[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(vid[u], vid[v] + 1);
        return;
      }
      f(vid[head[v]], vid[v] + 1);
      v = par[head[v]];
    }
  }
  void for_each_edge(int u, int v, function<void(int, int)> f) {
    while (true) {
      if (vid[u] > vid[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(vid[u] + 1, vid[v] + 1);
        return;
      }
      f(vid[head[v]], vid[v] + 1);
      v = par[head[v]];
    }
  }
  int lca(int u, int v) {
    while (true) {
      if (vid[u] > vid[v]) swap(u, v);
      if (head[u] == head[v]) return u;
      v = par[head[v]];
    }
  }
  int operator[](int k) {
    return vid[k];
  }
};

template <typename T>
struct SegmentTree {
  using F = function<T(T, T)>;
  vector<T> v;
  F f;
  T e;
  int n;
  SegmentTree(int size, F f, T e) : f(f), e(e) {
    n = 1;
    while (n < size) n <<= 1;
    v.resize(n * 2, e);
  }
  void set(int k, T x) {
    v[k + n] = x;
  }
  void build() {
    for (int i = n - 1; i > 0; i--) {
      v[i] = f(v[i * 2 + 0], v[i * 2 + 1]);
    }
  }
  void update(int k, T x) {
    v[k += n] = x;
    while (k >>= 1) v[k] = f(v[k * 2 + 0], v[k * 2 + 1]);
  }
  T query(int a, int b) {
    T l = e, r = e;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) l = f(l, v[a++]);
      if (b & 1) r = f(v[--b], r);
    }
    return f(l, r);
  }
};

void solve() {
  int n, q;
  cin >> n >> q;
  vector<vector<tuple<int, int, int>>> sources(n);
  vector<vi32> g(n);
  rep(i, n - 1) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a--, b--;
    g[a].push_back(b);
    g[b].push_back(a);
    sources[c].emplace_back(a, b, d);
  }

  auto hld = HLD(g);
  auto cnt = SegmentTree<int>(n, [](int a, int b) { return a + b; }, 0);
  auto sum = SegmentTree<i64>(n, [](i64 a, i64 b) { return a + b; }, 0);
  reps(i, n - 1) each(c, sources[i]) {
    int a, b, d;
    tie(a, b, d) = c;
    if (hld[a] < hld[b]) swap(a, b);
    sum.set(hld[a], d);
  }
  sum.build();

  vector<vector<tuple<int, int, int, int>>> queries(n);
  rep(i, q) {
    int x, y, u, v;
    cin >> x >> y >> u >> v;
    u--, v--;
    queries[x].emplace_back(i, u, v, y);
  }

  vi64 ans(q);
  reps(i, n - 1) {
    each(c, sources[i]) {
      int a, b, d;
      tie(a, b, d) = c;
      if (hld[a] < hld[b]) swap(a, b);
      cnt.update(hld[a], 1);
      sum.update(hld[a], 0);
    }
    each(q, queries[i]) {
      int i, u, v, y;
      tie(i, u, v, y) = q;
      int c = 0;
      i64 s = 0;
      hld.for_each_edge(u, v, [&](int l, int r) { c += cnt.query(l, r); });
      hld.for_each_edge(u, v, [&](int l, int r) { s += sum.query(l, r); }); 
      ans[i] = s + (i64) c * y;
    }
    each(c, sources[i]) {
      int a, b, d;
      tie(a, b, d) = c;
      if (hld[a] < hld[b]) swap(a, b);
      cnt.update(hld[a], 0);
      sum.update(hld[a], d);
    }
  }
  rep(i, q) cout << ans[i] << endl;
}


Measured memory_bytes: 29704