#include<bits/stdc++.h>
//using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//#define endl "\n"
using std::endl;
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
//constexpr ll MOD=1e9+7;
constexpr ll MOD=998244353;
//constexpr ll MOD=10000000;
constexpr ll MAX=1e7;
constexpr ll INF=(1ll<<60);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
struct Binary_indexed_tree{
    int N;
    vi bit;
    Binary_indexed_tree(int n):N(n){
        bit.resize(N+1,0);
    }
    void add(int x,int a){
        for(x;x<=N;x+=(x&-x)) bit[x]+=a;
    }
    ll sum(int x){
        ll ret=0;
        for(x;x>0;x-=(x&-x)) ret+=bit[x];
        return ret;
    }
    ll lower_bound(ll X){
        if(sum(N)<X) return -1;
        ll ret=0,memo=1,sum=0;
        while(memo*2<=N) memo*=2;
        while(memo>0){
            if(memo+ret<=N&&sum+bit[memo+ret]<X){
                sum+=bit[memo+ret];
                ret+=memo;
            }
            memo/=2;
        }
        return ret+1;
    }
};
struct Union_Find{
    ll N;
    vi par;
    vi siz;
    Union_Find(int n):N(n){
        par.resize(N);
        siz.resize(N,1);
        rep(i,0,N) par[i]=i;
    }
    ll root(ll X){
        if(par[X]==X) return X;
        return par[X]=root(par[X]);
    }
    bool same(ll X,ll Y){
        return root(X)==root(Y);
    }
    void unite(ll X,ll Y){
        X=root(X);
        Y=root(Y);
        if(X==Y) return;
        par[X]=Y;
        siz[Y]+=siz[X];
        siz[X]=0;
    }
    ll size(ll X){
        return siz[root(X)];
    }
};
ll modpow(ll X,ll Y,ll mod){
    ll sum=X,cnt=1;
    vi A;
    while(cnt<=Y){
        A.pb(sum);
        sum*=sum;
        sum%=mod;
        cnt*=2;
    }
    int M=A.size();
    ll ret=1;
    REP(i,1,M){
        if(Y>=(1ll<<M-i)){
            Y-=(1ll<<M-i);
            ret*=A[M-i];
            ret%=mod;
        }
    }
    return ret;
}
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; 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 COM(ll n,ll r){
    if(n<r||n<0||r<0) return 0;
    return fac[n]*finv[r]%MOD*finv[n-r]%MOD;
}
ll point(vii &memo,ll X,ll D){
    per(i,59,0){
        if(D>=(1ll<<i)){
            D-=(1ll<<i);
            X=memo[X][i];
        }
    }
    return X;
}
void dfs(ll X,vector<bool> &F,vii &edge,vii &c,vii &d,std::map<ll,ll> &cnt,std::map<ll,ll> &csum,vector<std::map<ll,ll>> &memcnt,vector<std::map<ll,ll>> &memcsum){
    rep(i,0,edge[X].size()){
        ll Y=edge[X][i];
        if(F[Y]){
            F[Y]=0;
            cnt[c[X][i]]++;
            csum[c[X][i]]+=d[X][i];
            dfs(Y,F,edge,c,d,cnt,csum,memcnt,memcsum);
            cnt[c[X][i]]--;
            csum[c[X][i]]-=d[X][i];
        }
    }
    for(auto p:memcnt[X]){
        memcnt[X][p.first]=cnt[p.first];
        memcsum[X][p.first]=csum[p.first];
    }
}
signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll N,Q; cin>>N>>Q;
    vii edge(N),c(N),d(N);
    rep(i,1,N){
        ll A,B,C,D; cin>>A>>B>>C>>D;
        edge[A-1].pb(B-1);
        edge[B-1].pb(A-1);
        c[A-1].pb(C);
        c[B-1].pb(C);
        d[A-1].pb(D);
        d[B-1].pb(D);
    }
    std::map<ll,ll> cnt,csum;
    vector<std::map<ll,ll>> memcnt(N),memcsum(N);
    vi sum(N);
    std::queue<int> que;
    vi Dep(N,-1);
    que.push(0);
    Dep[0]=0;
    while(!que.empty()){
        ll X=que.front(); que.pop();
        rep(i,0,edge[X].size()){
            ll Y=edge[X][i];
            if(Dep[Y]==-1){
                Dep[Y]=Dep[X]+1;
                sum[Y]=sum[X]+d[X][i];
                que.push(Y);
            }
        }
    }
    vii memo(N,vi(60));
    rep(i,0,N){
        rep(j,0,edge[i].size()){
            ll X=edge[i][j];
            if(Dep[X]<Dep[i]) memo[i][0]=X;
        }
    }
    rep(i,1,60){
        rep(j,0,N) memo[j][i]=memo[memo[j][i-1]][i-1];
    }
    vi root(Q),x(Q),y(Q),col(Q),to(Q);
    rep(i,0,Q){
        ll X,Y; cin>>col[i]>>to[i]>>X>>Y;
        X--;
        Y--;
        x[i]=X,y[i]=Y;
        if(Dep[X]>Dep[Y]) std::swap(X,Y);
        ll left=0,right=Dep[X];
        ll Dist=Dep[Y]-Dep[X];
        while(left+1<right){
            ll mid=(left+right)/2;
            if(point(memo,X,mid)==point(memo,Y,mid+Dist)) right=mid;
            else left=mid;
        }
        ll ans=right;
        if(point(memo,X,left)==point(memo,Y,left+Dist)) ans=left;
        root[i]=point(memo,X,ans);
        ans=root[i];
        memcnt[ans][col[i]]=memcnt[X][col[i]]=memcnt[Y][col[i]]=0;
    }
    vector<bool> F(N,1);
    F[0]=0;
    dfs(0,F,edge,c,d,cnt,csum,memcnt,memcsum);
    rep(i,0,Q){
        ll ans=sum[x[i]]+sum[y[i]]-sum[root[i]]*2;
        ans-=memcsum[x[i]][col[i]]+memcsum[y[i]][col[i]]-memcsum[root[i]][col[i]]*2;
        ans+=to[i]*(memcnt[x[i]][col[i]]+memcnt[y[i]][col[i]]-memcnt[root[i]][col[i]]*2);
        cout<<ans<<endl;
    }
}


Measured memory_bytes: 130920