#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 repp(i, n) rep(i, n)
#define reppp(i, n) repp(i, n)
#define rrepp(i, n) rrep(i, n)
#define repss(i, n) reps(i, n)
#define repcc(i, n) repc(i, n)
#define repii(i, a, b) repi(i, a, b)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

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) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
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 power(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> 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; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

template <typename T>
struct LCA {
  struct E {
    i64 to;
    T cost;
    i64 color;
    E(i64 to, i64 color, T cost) : to(to), color(color), cost(cost) {}
  };
  i64 n;
  i64 l;
  vector<vector<i64>> par;
  vector<i64> dep;
  vector<T> costs;
  vector<vector<E>> edges;
  LCA(i64 n) : n(n) {
    l = 0;
    while (bit(l) < n) l++;
    par = vector<vector<i64>>(n + 1, vector<i64>(l, n));
    dep.assign(n, 0);
    costs.assign(n, 0);
    edges.resize(n);
  }
  void add_edge(i64 from, i64 to, i64 color, T cost) {
    edges[from].emplace_back(to, color, cost);
    edges[to].emplace_back(from, color, cost);
  }
  void dfs(int v, int d=0, T c=0, int p=-1) {
    if (p != -1) par[v][0] = p;
    dep[v] = d;
    costs[v] = c;
    for (int i = 0; i < edges[v].size(); ++i) {
      auto e = edges[v][i];
      if (e.to == p) continue;
      dfs(e.to, d+1, c+e.cost, v);
    }
  }
  void init(int root=0) {
    dfs(root);
    for (int i = 0; i < l-1; ++i) {
      for (int v = 0; v < n; ++v) {
        par[v][i+1] = par[par[v][i]][i];
      }
    }
  }
  i64 lca(int a, int b) {
    if (dep[a] > dep[b]) swap(a,b);
    int gap = dep[b]-dep[a];
    for (int i = l-1; i >= 0; --i) {
      int len = 1<<i;
      if (gap >= len) {
        gap -= len;
        b = par[b][i];
      }
    }
    if (a == b) return a;
    for (int i = l-1; i >= 0; --i) {
      int na = par[a][i];
      int nb = par[b][i];
      if (na != nb) a = na, b = nb;
    }
    return par[a][0];
  }
  T cost(int a, int b) {
    int c = lca(a,b);
    return costs[a]+costs[b]-costs[c]*2;
  }
};

struct Query {
  int col, qid, coeff, y;
  Query(int col, int qid, int coeff, int y):col(col),qid(qid),coeff(coeff),y(y) {}
};

vector<Query> qs;
LCA<i64> lca(0);

const int MX = 100010;

struct Edge {
  i64 to, co, col;
  Edge(i64 to, i64 co, i64 col):to(to),co(co),col(col) {}
};
vector<Edge> edges[MX];

vi64 answers;
i64 cnt[MX];
i64 sum[MX];
vector<Query> queries[MX];
void dfs(i64 v, i64 p = -1) {
  each(q, queries[v]) {
    i64 x = -sum[q.col];
    x += (i64)q.y*cnt[q.col];
    answers[q.qid] += x*q.coeff;
  }
  each(e, edges[v]) {
    if (e.to == p) continue;
    cnt[e.col]++, sum[e.col] += e.co;
    dfs(e.to, v);
    cnt[e.col]--, sum[e.col] -= e.co;
  }
}

void solve() {
  i64 n, q; cin >> n >> q;
  lca = LCA<i64>(n);
  rep(i, n - 1) {
    i64 a, b, c, d; cin >> a >> b >> c >> d;
    a--, b--;
    lca.add_edge(a, b, c, d);
    edges[a].emplace_back(b, d, c);
    edges[b].emplace_back(a, d, c);
  }
  lca.init();

  answers = vi64(q);

  rep(i, q) {
    i64 x, y, u, v; cin >> x >> y >> u >> v;
    u--, v--;
    i64 c = lca.lca(u, v);
    queries[u].emplace_back(x,i,1,y);
    queries[v].emplace_back(x,i,1,y);
    queries[c].emplace_back(x,i,-2,y);
    answers[i] = lca.costs[u] + lca.costs[v] - lca.costs[c] * 2;
  }
  dfs(0);
  rep(i, q) {
    cout << answers[i] << '\n';
  }
}


Measured memory_bytes: 51444