#ifdef LOCAL111
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

// 検証しなおしたい

//library
typedef P cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

//library
class LCA{
public:
	vector<vector<int>> parent;
	vector<int> depth;
	int maxlogv;
	LCA(const Graph &g, int root){
		int n = g.size();
		maxlogv = 0;
		int n_ = n;
		while(n_ != 0){
			n_ >>= 1;
			maxlogv++;
		}
		if((1<<maxlogv) < n) maxlogv++;
		parent = vector<vector<int>>(maxlogv,vector<int>(n,-1));
		depth = vector<int>(n,0);
		function<void(int,int,int)> dfs = [&](int v, int p, int d){
			parent[0][v] = p;
			depth[v] = d;
			for(const auto &e : g[v]){
				if(e.to != p) dfs(e.to, v, d+1);
			}
		};
		dfs(root,-1,0);
		for(int k = 0; k+1 < maxlogv; k++){
			for(int v = 0; v < n; v++){
				if(parent[k][v] < 0) parent[k+1][v] = -1;
				else parent[k+1][v] = parent[k][parent[k][v]];
			}
		}
	}

	int query(int u, int v){
		if(depth[u] > depth[v]) swap(u,v);
		for(int k = 0; k < maxlogv; k++){
			if((depth[v]-depth[u]) >> k & 1){
				v = parent[k][v];
			}
		}
		if(u == v) return u;
		for(int k = maxlogv-1; k >= 0; k--){
			if(parent[k][u] != parent[k][v]){
				u = parent[k][u];
				v = parent[k][v];
			}
		}
		return parent[0][u];
	}
};
//library


int main()
{
	ios_init();
	int n, q;
	while(cin >> n >> q) {
		Graph g(n);
		REP(i, n - 1) {
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			a--; b--; c--;
			g.add_uedge(a, b, {c, d});
		}

		LCA lca(g, 0);
		
		using Q = P;

		vector<int> x(q), y(q), u(q), v(q);
		REP(i, q){ 
			cin >> x[i] >> y[i] >> u[i] >> v[i];
			u[i]--; v[i]--; x[i]--;
		}

		vector<vector<int>> qv(n);

		REP(i, q) {
			int l = lca.query(u[i], v[i]);
			qv[l].emplace_back(i + 1);
			qv[u[i]].emplace_back(-(i + 1));
			qv[v[i]].emplace_back(-(i + 1));
		}

		vector<int> ans(q);
		vector<int> dv(q);
		vector<int> nv(q);
		vector<int> curd(q);
		vector<int> curn(q);
		int dist = 0;
		function<void(int, int)> dfs = [&](int p, int pre) {
			for(auto&& e : qv[p]) {
				if(e < 0) {
					int qi =  -e;
					qi--;
					dv[qi] += curd[x[qi]];
					nv[qi] += curn[x[qi]];
					ans[qi] += dist;
				} else {
					int qi =  e;
					qi--;
					dv[qi] -= 2 * curd[x[qi]];
					nv[qi] -= 2 * curn[x[qi]];
					ans[qi] -= 2 * dist;
				}
			}
			for(auto&& e : g[p]) {
				if(e.to == pre) continue;
				dist += e.cost.S;
				curd[e.cost.F] += e.cost.S;
				curn[e.cost.F]++;
				
				dfs(e.to, p);

				dist -= e.cost.S;
				curd[e.cost.F] -= e.cost.S;
				curn[e.cost.F]--;
			}
		};
		dfs(0, -1);

		dpite(ALL(ans));
		REP(i, q) {
			ans[i] = ans[i] - dv[i] + nv[i] * y[i];
		}
		REP(i, SZ(ans)) {
			cout << ans[i] << endl;
		}

	}
	return 0;
}


Measured memory_bytes: 29176