#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace::std;
//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
__attribute__((constructor))
void init(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(15);
}
// random_device rd;
// mt19937 mt(rd());
// #include <boost/numeric/interval.hpp>
// #include <boost/numeric/interval/io.hpp>
// #include <boost/intrusive/rbtree.hpp>
// #include <boost/dynamic_bitset.hpp>
// #include <boost/geometry.hpp>
// #include <boost/geometry/geometries/linestring.hpp>
// #include <boost/geometry/geometries/polygon.hpp>
// #include <boost/geometry/geometries/point_xy.hpp>
// #include <boost/math/tools/minima.hpp>
// using boost::math::tools::brent_find_minima;
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<256>> cdouble;
// typedef mp::cpp_int cint;
// #include <boost/unordered_map.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
template<typename T=long long>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
//#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define LINF 9223372036854775807
//#define MOD 998244353LL
#define MOD 1000000007LL
#define endl "\n"
//struct in{template<class T>operator T(){T t;cin>>t;return t;}};
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(int i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(int i=0;i<t.size();i++)output(t[i]);}
auto Y=[&](auto f){return[&](auto... args){return f(f, args...);};};
template<typename T=lint>T in(){return *istream_iterator<T>(cin);}
template<typename T=lint>inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline T minq(T a,T b){return min(a,b);}
template<typename T>inline T maxq(T a,T b){return max(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};

template<typename T>
struct persistent_array{
    struct node;
    using np=node*;
    struct node{
        T data;
        np ch[20];
    };
    np root=nullptr;
    persistent_array(){}
    np get_root(){
        return root;
    }
    np set(int idx,T val,const np& t){
        np res=new node();
        if(t){
            memcpy(res->ch,t->ch,sizeof(t->ch));
            res->data=t->data;
        }
        if(idx==0){
            res->data=val;
        }else{
            res->ch[idx%20]=set(idx/20,val,res->ch[idx%20]);
        }
        return res;
    }
    T get(int idx,np t){
        if(!t)return 0;
        if(idx==0){
            return t->data;
        }else{
            return get(idx/20,t->ch[idx%20]);
        }
    }
};

template<typename Int>
class LCA{
    template<typename T>
    class sparse_table{
        using F=function<T(T,T)>;
        F f;
        vector<vector<T>>data;
        public:
        sparse_table(vector<T> v,F f):f(f){
            int n=v.size(),log=log2(n)+1;
            data.resize(n,vector<T>(log));
            for(int i=0;i<n;i++)data[i][0]=v[i];
            for(int j=1;j<log;j++)for(int i=0;i+(1<<(j-1))<n;i++){
                data[i][j]=f(data[i][j-1],data[i+(1<<(j-1))][j-1]);
            }
        }
        T get(int l,int r){
            if(r<l)swap(l,r);
            //assert(0<l||r<=(T)data.size());
            int k=log2(r-l);
            return f(data[l][k],data[r-(1<<k)][k]);
        }
    };
    vector<pair<Int,Int>> data;
    vector<Int> start;
    sparse_table<pair<Int,Int>>* st;
    public:
    LCA(vector<vector<Int>> v,Int s){
        data.resize(v.size()*2-1);
        start.resize(v.size());
        Int i=0;
        auto Y=[&](auto f){return[&](auto... args){return f(f, args...);};};
        vector<Int> dep=depth(s,v);
        auto f=Y([&](auto f,Int n,Int p)->void{
            start[n]=i;
            data[i++]=make_pair(dep[n],n);
            for(Int t:v[n]){
                if(t==p)continue;
                f(f,t,n);
                data[i++]=make_pair(dep[n],n);
            }
        });
        f(s,-1);
        st=new sparse_table<pair<Int,Int>>(data,[](auto s,auto t){return s.first>t.first?s:t;});
    }
    Int lca(int p,int q){
        return st->get(min(start[p],start[q]),max(start[p],start[q])+1).second;
    }
    private:
    vector<Int> depth(Int start,vector<vector<Int>>G){
        auto Y=[&](auto f){return[&](auto... args){return f(f, args...);};};
        vector<Int>memo(G.size());
        auto f=Y([&](auto f,Int v,Int p)->Int{
            Int mx=0;
            for(auto t:G[v]){
                if(t==p)continue;
                mx=max(mx,f(f,t,v));
            }
            return memo[v]=mx+1;
        });
        f(start,-1);
        return memo;
    }
};

using PA=persistent_array<lint>;
int main(){
    lint n,q;
    cin>>n>>q;
    PA pa;
    PA pa2;
    vector<PA::np>v(n);
    vector<PA::np>cnt(n);
    vector<vector<tuple<lint,lint,lint>>>l(n);
    vector<vector<lint>>g(n);
    vector<lint>su(n,0);
    rep(i,n-1){
        lint a,b,c,d;
        cin>>a>>b>>c>>d;
        a--;b--;c--;
        l[a].emplace_back(b,c,d);
        l[b].emplace_back(a,c,d);
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    LCA<lint> lca(g,0);
    function<void(lint,lint)> f=[&](lint p,lint k){
        for(auto data:l[k]){
            lint t,c,d;
            tie(t,c,d)=data;
            if(t==p)continue;
            else{
                su[t]=su[k]+d;
                v[t]=pa.set(c,pa.get(c,v[k])+d,v[k]);
                cnt[t]=pa.set(c,pa.get(c,cnt[k])+1,cnt[k]);
                f(k,t);
            }
        }
    };
    v[0]=pa.get_root();
    cnt[0]=pa2.get_root();
    f(-1,0);
    rep(i,q){
        lint c,d,s,t;
        cin>>c>>d>>s>>t;
        c--;s--;t--;
        lint u=lca.lca(s,t);
        lint sv=su[s]+pa.get(c,cnt[s])*d-pa.get(c,v[s]);
        lint tv=su[t]+pa.get(c,cnt[t])*d-pa.get(c,v[t]);
        lint uv=su[u]+pa.get(c,cnt[u])*d-pa.get(c,v[u]);
        cout<<sv+tv-2*uv<<endl;
    }
}


Measured memory_bytes: 273824