#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << std::endl; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) std::cerr << std::boolalpha << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); std::cerr << std::noboolalpha;
#else
	#define debug(...)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	template<typename T> class dvector : public std::vector<T> {
	public:
		dvector() : std::vector<T>() {}
		explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
		dvector(const std::vector<T>& v) : std::vector<T>(v) {}
		dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
		dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
		dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
		T& operator[](size_t n) {
			try { return this->at(n); } catch (const std::exception& e) {
				std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
			}
		}
		const T& operator[](size_t n) const {
			try { return this->at(n); } catch (const std::exception& e) {
				std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
			}
		}
	};
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		dbool(const dbool &b) : boolvalue(b.boolvalue) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector<T>& v) {
		for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector< dvector<T> >& vv) {
		for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << std::endl; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << std::endl; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << std::endl; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{" << std::endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << std::endl; } s << "}" << std::endl; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) { 
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
template<typename T> inline void pv(vector<T> &v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

/*-----8<-----template-----8<-----*/

/*
最小共通祖先(Doubling-Lowest-Common-Ancestor)
DoublingLowestCommonAncestor(g):= 木 g で初期化する。
build():= 構築する。
query(u, v):= 頂点 u と v の最小共通祖先を返す。
 */
template< typename G >
class DoublingLowestCommonAncestor {
public:
	const G &g;
	vector< int > depth;//depth[v]=根からvまでの距離
	const int LOG;
	vector< vector< int > > table;

	DoublingLowestCommonAncestor(const G &g) : g(g), depth(g.size()), LOG(32 - __builtin_clz(g.size())) {
		table.assign(LOG, vector< int >(g.size(), -1));
	}

	void dfs(int idx, int par, int d) {
		table[0][idx] = par;
		depth[idx] = d;
		for(auto &to : g[idx]) {
			if(to != par) dfs(to, idx, d + 1);
		}
	}

	void build() {
		dfs(0, -1, 0);
		for(int k = 0; k + 1 < LOG; k++) {
			for(int i = 0,tablesize = table[k].size(); i < tablesize; i++) {
				if(table[k][i] == -1) table[k + 1][i] = -1;
				else table[k + 1][i] = table[k][table[k][i]];
			}
		}
	}

	int query(int u, int v) {
		if(depth[u] > depth[v]) swap(u, v);
		for(int i = LOG - 1; i >= 0; i--) {
			if(((depth[v] - depth[u]) >> i) & 1) v = table[i][v];
		}
		if(u == v) return u;
		for(int i = LOG - 1; i >= 0; i--) {
			if(table[i][u] != table[i][v]) {
				u = table[i][u];
				v = table[i][v];
			}
		}
		return table[0][u];
	}
};

/*-----8<-----library-----8<-----*/

const ll N_MAX = 1e5;
const ll Q_MAX = 1e5;
const ll D_I_MAX = 1e4;
const ll Y_J_MAX = 1e4;

ll N, Q;
vector<ll> a;
vector<ll> b;
vector<ll> c;
vector<ll> d;
vector<ll> x;
vector<ll> y;
vector<ll> u;
vector<ll> v;
//from,to -> 色,距離
map<pair<ll,ll>,pair<ll,ll>> path;


//now[色]=色の数,距離
//memo[頂点]=色set
//dis[頂点][色]=距離
//col[頂点][色]=数
void dfs(vector<vector<ll>> &g,ll v,ll p,vector<set<ll>> &memo,vector<map<ll,ll>> &dis,vector<map<ll,ll>> &col,vector<pair<ll,ll>> &now, vector<ll> &kyoriv,ll kyori){
	debug(v);
	//更新
	if(p!=-1){
		ll from=v,to=p;
		if(from>to)swap(from,to);
		ll c=path[{from,to}].first;
		ll d=path[{from,to}].second;
		now[c].first+=1;
		now[c].second+=d;
		kyori+=d;
		kyoriv[v]=kyori;
	}
	//メモを見る
	for(ll c:memo[v]){
		col[v][c]=now[c].first;
		dis[v][c]=now[c].second;
	}

	for(ll nextv:g[v]){
		if(nextv==p)continue;
		dfs(g,nextv,v,memo,dis,col,now,kyoriv,kyori);
	}

	//更新
	if(p!=-1){
		ll from=v,to=p;
		if(from>to)swap(from,to);
		ll c=path[{from,to}].first;
		ll d=path[{from,to}].second;
		now[c].first-=1;
		now[c].second-=d;
	}	
}



void solve() {
	scanf("%lld%lld", &N, &Q);
	a.assign(N, 0);
	b.assign(N, 0);
	c.assign(N, 0);
	d.assign(N, 0);
	rep(i, N-1){
		scanf("%lld%lld%lld%lld", &a[i], &b[i], &c[i], &d[i]);
		a[i]--;b[i]--;
		ll from=a[i],to=b[i];
		if(from>to)swap(from,to);
		path[{from,to}]={c[i],d[i]};
	}
	x.assign(Q, 0);
	y.assign(Q, 0);
	u.assign(Q, 0);
	v.assign(Q, 0);
	rep(i, Q) {
		scanf("%lld%lld%lld%lld", &x[i], &y[i], &u[i], &v[i]);
		u[i]--;v[i]--;
	}

	//memo[頂点]=色set
	vector<set<ll>> memo(N);
	rep(i,Q){
		memo[u[i]].insert(x[i]);
		memo[v[i]].insert(x[i]);
	}

	vector<vector<ll>> g(N);
	rep(i,N-1){
		ll from=a[i];
		ll to=b[i];
		g[from].push_back(to);
		g[to].push_back(from);
	}

	debug(g);
	DoublingLowestCommonAncestor< vector<vector<ll>> > lca(g);
	lca.build();
	vector<ll> lcaq(Q,0);
	rep(i,Q){
		ll lcav=lca.query(u[i], v[i]);
		lcaq[i]=lcav;
		debug(lcav);
		memo[lcav].insert(x[i]);
	}


	debug(memo);

	//dis[頂点][色]=距離
	//col[頂点][色]=数
	vector<map<ll,ll>> dis(N),col(N);
	vector<pair<ll,ll>> now(N);
	vector<ll> kyoriv(N,0);
	dfs(g,0,-1,memo,dis,col,now,kyoriv,0);

	vector<ll> ans(Q,0);
	rep(i,Q){
		ll d=kyoriv[u[i]] + kyoriv[v[i]] - kyoriv[lcaq[i]]*2;
		debug(d);
		d=d-dis[u[i]][x[i]]-dis[v[i]][x[i]] + dis[lcaq[i]][x[i]]*2;
		d=d+y[i]*(col[u[i]][x[i]] + col[v[i]][x[i]] - col[lcaq[i]][x[i]]*2);
		ans[i]=d;
	}

	
	rep(i,Q)printf("%lld\n", ans[i]);
}

// https://atcoder.jp/contests/abc133/tasks/abc133_f
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 93552