#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;
double EPS = 1e-11;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 2000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}


//Lowest Common Ancestor
//initがあるの注意
const ll MAX_V = 100010;
const ll MAX_LOG_V = 20;
vector<ll> G[MAX_V];
ll root = 0;//根のノード番号

ll parent[MAX_LOG_V][MAX_V];
//2^k回親をたどって到達する点
//根を通り過ぎる時は-1

ll depth[MAX_V];
void dfs_lca(ll v, ll p, ll d){
  parent[0][v] = p;
  depth[v] = d;
  for(ll to : G[v]){
    if(to == p) continue;
    dfs_lca(to, v, d + 1);
  }
}

void init_lca(ll V = 100009){
  dfs_lca(root, -1, 0);
  for(ll k = 0; k + 1 < MAX_LOG_V; k++){
    for(ll v = 0; v < V; v++){
      if(parent[k][v] < 0) parent[k+1][v] = -1;
      else parent[k+1][v] = parent[k][parent[k][v]];
    }
  }
}

//uとvのLCAを求める
ll lca(ll u, ll v){
  if(depth[u] > depth[v]) swap(u, v);
  for(ll k = 0; k < MAX_LOG_V; k++){
    if((depth[v] - depth[u]) >> k & 1){
      v = parent[k][v];
    }
  }
  if(u == v) return u;
  //二分探索でLCAを求める
  for(ll k = MAX_LOG_V - 1; k >= 0; k--){
    if(parent[k][u] != parent[k][v]){
      u = parent[k][u];
      v = parent[k][v];
    }
  }
  return parent[0][u];
}


ll N, Q;
struct edge{ll to, col, dist;};
vector<edge> E[100010];
struct query{ll id, col, dist, w;};
vector<query> Que[100010];
ll ans[100010];

ll sum[100010], num[100010];
void dfs(ll now, ll from, ll dep){
  for(query q: Que[now]){
    ans[q.id] += (dep + q.dist * num[q.col] - sum[q.col]) * q.w;
  }
  for(edge e: E[now])if(e.to != from){
    sum[e.col] += e.dist;
    num[e.col]++;
    dfs(e.to, now, dep + e.dist);
    sum[e.col] -= e.dist;
    num[e.col]--;
  }
}

void solve(){
  cin >> N >> Q;
  rep(i, N-1){
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    a--, b--, c--;
    E[a].pb({b, c, d});
    E[b].pb({a, c, d});
    G[a].pb(b);
    G[b].pb(a);
  }
  init_lca();
  rep(i, Q){
    ll x, y, u, v;
    cin >> x >> y >> u >> v;
    x--, u--, v--;
    ll LCA = lca(u, v);
    Que[u].pb({i, x, y, 1});
    Que[v].pb({i, x, y, 1});
    Que[LCA].pb({i, x, y, -2});
  }
  dfs(0, -1, 0);
  rep(i, Q){
    cout << ans[i] << endl;
  }
}



int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 56048