#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#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;
	using namespace boost::multiprecision;
#endif
#if __has_include(<boost/stacktrace.hpp>)
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
	namespace std {
		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 std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_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() << '\n'; 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() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
#endif
#ifdef LOCAL_DEV
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } 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 << "}"; 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 << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; 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 << ")"; }
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#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 ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#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 rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::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 bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

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

/*
https://qiita.com/hotman78/items/9c643feae1de087e6fc5
配列の長さは特に指定しなくて大丈夫そう
get_root() := 初期状態を返す
set(ll idx, T val, Node*& t) := 状態tの配列に対して t[idx]=val した後の状態を返す
destructive_set(ll idx, T val, Node*& t) := 状態tの配列に対して破壊的に t[idx]=val する(状態コピーされない)
get(ll idx, Node* t) := 状態tの配列に対してt[idx]の値を返す
*/
constexpr ll N_ary = 20;
template<typename T>
class PersistentArray{
public:
	struct Node{
		T data;
		Node* ch[N_ary];
	};
	Node* root=nullptr;

	PersistentArray(){}
	Node* get_root(){
		return root;
	}
	Node* set(ll idx, T val, Node*& t){
		Node* 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%N_ary]=set(idx/N_ary, val, res->ch[idx%N_ary]);
		}
		return res;
	}
	void destructive_set(ll idx, T val, Node*& t){
		if(!t)t=new Node();
		if(idx==0){
			t->data=val;
		}else{
			destructive_set(idx/N_ary,val,t->ch[idx%N_ary]);
		}
	}
	T get(ll idx, Node* t){
		if(!t)return 0;
		if(idx==0){
			return t->data;
		}else{
			return get(idx/N_ary, t->ch[idx%N_ary]);
		}
	}
};

////

/*
最小共通祖先(Doubling-Lowest-Common-Ancestor)
DoublingLowestCommonAncestor(g):= 木 g で初期化する。
build(v):= vを根としたLCAを構築する。
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(int v) {
		dfs(v, -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<-----*/

void solve() {
	ll N,Q;
	cin>>N>>Q;
	vector<vector<ll>> g(N);
	vector<vector<array<ll,4>>> colorg(N);
	rep(i,N-1){
		ll a,b,c,d;
		cin>>a>>b>>c>>d;
		a--;b--;c--;
		g[a].push_back(b);
		g[b].push_back(a);
		colorg[a].push_back({a,b,c,d});
		colorg[b].push_back({b,a,c,d});
	}

	DoublingLowestCommonAncestor< vector<vector<ll>> > lca(g);
	lca.build(0);

	using Node = PersistentArray<ll>::Node;
	PersistentArray<ll> pa;
	//pa.get(c, colorcount[v])=根から頂点vまでの色cの辺の数
	//pa.get(c, colordist[v])=根から頂点vまでの色cだけ足したときの距離
	vector<Node*> colorcount(N);
	vector<Node*> colordist(N);
	//dist[v]=普通に根から頂点vまでの距離
	vector<ll> dist(N,0);

	auto dfs = [&](auto&& dfs, ll v, ll p)->void{
		for(array<ll,4> nextedge:colorg[v]){
			ll nextv=nextedge[1];
			ll c=nextedge[2];
			ll d=nextedge[3];
			if(nextv==p)continue;
			dist[nextv]=dist[v]+d;
			colordist[nextv]=pa.set(c, pa.get(c,colordist[v])+d, colordist[v]);
			colorcount[nextv]=pa.set(c, pa.get(c,colorcount[v])+1, colorcount[v]);
			dfs(dfs,nextv,v);
		}
	};
	colordist[0]=pa.get_root();
	colorcount[0]=pa.get_root();
	dfs(dfs,0,-1);

	vector<ll> anslist(Q);
	rep(q,Q){
		ll x,y,u,v;
		cin>>x>>y>>u>>v;
		x--;u--;v--;
		//色xの辺の長さをyに変えた状態で、根から頂点tまでの距離
		auto f=[&](ll t){
			return dist[t] + pa.get(x,colorcount[t])*y - pa.get(x,colordist[t]);
		};
		ll lcav=lca.query(u,v);
		ll ucost=f(u);
		ll vcost=f(v);
		ll lcavcost=f(lcav);
		anslist[q]=ucost+vcost-lcavcost*2;
	}

	rep(q,Q)p(anslist[q]);
}

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


Measured memory_bytes: 217848