#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
  {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
  {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
  {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
  #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

struct TreeDoubling {
  struct Edge { int to, color, len; }; // 場合に応じて書き換える
  vector<vector<Edge>> g;
  int n, size; // MSB + 1
  int root;
  vector<int> depth;
  vector<vector<int>> parent; // ダミー頂点n(親もn)
  TreeDoubling(int n) : g(n), n(n), depth(n), size(64 - __builtin_clzll(n)) {
    parent.resize(size, vector<int>(n + 1, n));
  }
  void dfs(int v, int prev, int d) {
    depth[v] = d;
    parent[0][v] = prev;
    for (auto& s : g[v]) if (s.to != prev) {
      dfs(s.to, v, d + 1);
    }
  }
  void build(int root_ = 0) {
    root = root_;
    dfs(root, n, 0);
    for (int k = 0; k < size - 1; k++) {
      for (int i = 0; i < n; i++) {
        parent[k + 1][i] = parent[k][parent[k][i]];
      }
    }
  }
  
  // vからd個分親にさかのぼった頂点、rootよりも上はnを返す
  int query(int v, int d) {
    int ret = v;
    for (int j = 0; j < size; j++) {
      if (d >> j & 1) ret = parent[j][ret];
    }
    return ret;
  }
  int lca(int u, int v) {
    if (depth[u] > depth[v]) swap(u, v);
    v = query(v, depth[v] - depth[u]);
    if (u == v) return u;

    for (int j = size - 1; j >= 0; j--) {
      if (parent[j][u] == parent[j][v]) continue;
      u = parent[j][u];
      v = parent[j][v];
    }
    assert(parent[0][u] == parent[0][v]);
    return parent[0][u];
  }
};

signed main() {
  int n, Q; cin >> n >> Q;
  TreeDoubling td(n);
  REP (i, n - 1) {
    int a, b, c, d; cin >> a >> b >> c >> d;
    a--;
    b--;
    td.g[a].push_back({b, c, d});
    td.g[b].push_back({a, c, d});
  }
  td.build();

  struct Query { int q, color, len, mul; };
  vector<vector<Query>> ps(n); // {c, mul}
  REP (q, Q) {
    int x, y, u, v; cin >> x >> y >> u >> v;
    u--;
    v--;
    ps[u].push_back({q, x, y, 1});
    ps[v].push_back({q, x, y, 1});
    int z = td.lca(u, v);
    if (z < n) ps[z].push_back({q, x, y, -2});
  }

  vector<int> acc(n), num(n), ans(Q);
  int dist = 0;
  function<void(int, int)> dfs = [&](int v, int p) {
    for (auto& p : ps[v]) {
      ans[p.q] += (dist - acc[p.color] + num[p.color] * p.len) * p.mul;
    }
    for (auto& e : td.g[v]) if (e.to != p) {
      dist += e.len;
      acc[e.color] += e.len;
      num[e.color]++;
      dfs(e.to, v);
      dist -= e.len;
      acc[e.color] -= e.len;
      num[e.color]--;
    }
  };
  dfs(0, n);
  REP (q, Q) cout << ans[q] << endl;
}


Measured memory_bytes: 46060