#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>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll 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);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
//const int INF = 1 << 30;//10^9
const ll INF = INFL;
ll MOD = 1000000007;
//ll MOD = 998244353;

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, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_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){
  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){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//素因数列挙
vector<ll> MakePrimeList(ll x) {
    vector<ll> res;
    for(ll k=2; k*k<=x; k++) {
        if(x % k == 0) {
            res.pb(k);
            while(x % k == 0) x /= k;
        }
    }
    if(x > 1) res.push_back(x);
    return res;
}



//コンビネーション
const int MAXcomb = 2000100;
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;
}
ll disit(ll x){
  ll res = 0;
  while(x){
    res++;
    x /= 10;
  }
  return res;
}


//Lowest Common Ancestor
//initがあるの注意
const ll MAX_V = 200010;
const ll MAX_LOG_V = 30;
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 = 200009){
  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, cost;};
vector<edge> E[100010];
struct query{ll col, cost, id; bool flag;};
vector<query> query_of_tree[100010];
ll num_col[100010];
ll sum_col[100010];
ll ans[100010];
ll U[100010], V[100010];
ll dist[100010];

void make_dist(ll now, ll from, ll sum){
  dist[now] = sum;
  for(edge e: E[now]){
    if(e.to == from) continue;
    make_dist(e.to, now, sum + e.cost);
  }
}

void dfs(ll now, ll from){
  for(query q: query_of_tree[now]){
    if(q.flag) ans[q.id] += num_col[q.col] * q.cost - sum_col[q.col];
    else ans[q.id] -= 2 * (num_col[q.col] * q.cost - sum_col[q.col]);
  }
  for(edge e: E[now]){
    if(e.to == from) continue;
    num_col[e.col]++;
    sum_col[e.col] += e.cost;
    dfs(e.to, now);
    num_col[e.col]--;
    sum_col[e.col] -= e.cost;
  }
}

void solve(){
  cin >> N >> Q;
  rep(i, N-1){
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    a--, b--;
    G[a].pb(b);
    G[b].pb(a);
    edge e;
    e.to = a;
    e.col = c;
    e.cost = d;
    E[b].pb(e);
    e.to = b;
    E[a].pb(e);
  }
  init_lca();
  rep(i, Q){
    ll x, y, u, v;
    cin >> x >> y >> U[i] >> V[i];
    U[i]--, V[i]--;
    query q;
    q.id = i;
    q.col = x;
    q.cost = y;
    q.flag = 1;
    query_of_tree[U[i]].pb(q);
    query_of_tree[V[i]].pb(q);
    q.flag = 0;
    query_of_tree[lca(U[i], V[i])].pb(q);
  }
  make_dist(0, -1, 0);
  dfs(0, -1);
  rep(i, Q){
    ll L = lca(U[i], V[i]);
    ans[i] += dist[U[i]] + dist[V[i]] - 2 * dist[L];
  }
  rep(i, Q){
    cout << ans[i] << endl;
  }
}

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


Measured memory_bytes: 91760