#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bitComb(a,n,k) for(int a##x,a##y,a=(1<<k)-1;a<(1<<n);a##x=a&-a,a##y=a+a##x,a=(((a&~a##y)/a##x)>>1)|a##y)
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end())
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
//V<ll>fac,rfac;void setFac(int n,int mod){fac=rfac=V<ll>(++n);fac[0]=1;FOR(i,1,n)fac[i]=fac[i-1]*i%mod;rfac[n-1]=modInv(fac[n-1],mod);FORR(i,n-1,1)rfac[i-1]=rfac[i]*i%mod;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 1e5;
int n, q, s[N], ts[N], tc[N], su;
int x[N], y[N], u[N], v[N], r[N];
VV<int> e;
V<int> w[N];
V<pair<int, pii>> e2[N];
map<int, pii> m[N];
struct LCA{
  int ln;
  vector<vector<int>> parent;
  vector<int> depth;
  int root(int a, int b){
    if(depth[a] > depth[b]) swap(a, b);
    int d = depth[b] - depth[a];
    for(int i=0; i<ln; i++) if((1<<i)&d) b = parent[i][b];
    if(a==b) return a;
    for(int i=ln-1; i>=0; i--) if(parent[i][a] != parent[i][b]) a = parent[i][a], b = parent[i][b];
    return parent[0][a];
  }
  void build(const vector<vector<int>>&G, int r){
    int n = G.size();
    for(ln=1; (1<<ln)<n; ln++);
    parent = vector<vector<int>>(ln, vector<int>(n));
    depth = vector<int>(n);
    function<void (int, int, int)> dfs = [&](int a, int p, int d){
      parent[0][a] = p;
      depth[a] = d;
      for(int b:G[a]) if(p!=b) dfs(b, a, d+1);
    };
    dfs(r, -1, 0);
    for(int i=1; i<ln; i++)for(int j=0; j<n; j++) parent[i][j] = (parent[i-1][j]<0) ? -1 : parent[i-1][parent[i-1][j]];
  }
} lca;
void dfs(int a, int p){
  s[a] = su;
  uniq(w[a]);
  for(int&c:w[a]) m[a][c] = mp(tc[c], ts[c]);
  for(pair<int, pii>&b:e2[a]) if(b.fi != p){
    su += b.se.se;
    ts[b.se.fi] += b.se.se;
    tc[b.se.fi]++;
    dfs(b.fi, a);
    su -= b.se.se;
    ts[b.se.fi] -= b.se.se;
    tc[b.se.fi]--;
  }
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> q;
  e.resize(n);
  FOR(_, 1, n){
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a--; b--;
    e[a].pb(b);
    e[b].pb(a);
    e2[a].pb(mp(b, mp(c, d)));
    e2[b].pb(mp(a, mp(c, d)));
  }
  lca.build(e, 0);
  FOR(i, 0, q){
    cin >> x[i] >> y[i] >> u[i] >> v[i];
    u[i]--; v[i]--;
    r[i] = lca.root(u[i], v[i]);
    w[u[i]].pb(x[i]);
    w[v[i]].pb(x[i]);
    w[r[i]].pb(x[i]);
  }
  dfs(0, -1);
  FOR(i, 0, q){
    ll ans = 0;
    ans +=  s[u[i]]-m[u[i]][x[i]].se+m[u[i]][x[i]].fi*y[i];
    ans +=  s[v[i]]-m[v[i]][x[i]].se+m[v[i]][x[i]].fi*y[i];
    ans -= (s[r[i]]-m[r[i]][x[i]].se+m[r[i]][x[i]].fi*y[i])*2;
    cout << ans << endl;
  }
}

Measured memory_bytes: 53292