#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
//#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
#define dbg(...) void(0)

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

const int B = 300;
vector<vector<tuple<int,int,int>>> e;
map<int, vector<pi>> sum;
map<int, int> cnt;
map<int, vector<tuple<int,int,int,int>>> se;

void rec(int c, int p, int cnt, int dist, int col){
	dbg(c, p, cnt, dist, col);
	sum[col][c] = pi(cnt, dist);
	for(auto i : e[c]){
		int to, ec, d; tie(to, ec, d) = i;
		if(to != p) rec(to, c,
			cnt + (col < 0 || ec == col),
			dist + (col < 0 || ec == col ? d : 0),
			col);
	}
}

const int MX = 500010;
const int MX_L=19;

int n;
int parent[MX_L][MX];
int depth[MX];

void dfs(int c, int p, int d){
	depth[c] = d;
	parent[0][c] = p;
	for(auto i : e[c]){
		int to = get<0>(i);
		if(to == p) continue;
		dfs(to, c, d + 1);
	}
}
inline int lca(int a, int b){
	if(depth[a] > depth[b]) swap(a, b);
	int d = depth[b] - depth[a];
	rep(i, MX_L) if(d & 1 << i) b = parent[i][b];
	if(a == b) return a;
	for(int i = MX_L - 1; i >= 0; i--) if(parent[i][a] != parent[i][b]){
		a = parent[i][a];
		b = parent[i][b];
	}
	return parent[0][a];
}

pi calc(int from, int to, int col){
	if(col < 0 || cnt[col] >= B){
		pi st = sum[col][to];
		pi sf = sum[col][from];
		return pi(sf.first - st.first, sf.second - st.second);
	}
	int cnt = 0, dist = 0;
	for(auto i : se[col]){
		int a, b, c, d; tie(a, b, c, d) = i;
		if(depth[a] < depth[b]) swap(a, b);
		dbg(a, b, c, d);
		dbg(depth[from], depth[to], depth[a], depth[b]);
		if(!(depth[from] >= depth[a] && depth[b] >= depth[to])) continue;
		if(lca(from, a) != a || lca(from, b) != b) continue;
		cnt++;
		dist += d;
	}
	dbg(from, to);
	dbg(cnt, dist, col, se[col].size());
	return pi(cnt, dist);
}

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	
	int q; cin >> n >> q;
	e.resize(n);
	vector<tuple<int,int,int,int>> in;
	rep(i, n - 1){
		int a, b, c, d; cin >> a >> b >> c >> d; a--; b--;
		e[a].emplace_back(b, c, d);
		e[b].emplace_back(a, c, d);
		in.emplace_back(a, b, c, d);
		cnt[c]++;
	}
	
	parent[0][n] = n;
	dfs(0, n, 1);
	rep(i, MX_L - 1) rep(j, n) parent[i + 1][j] = parent[i][parent[i][j]];
	
	cnt[-1] = n;
	sum[-1] = vector<pi>(n);
	rec(0, 0, 0, 0, -1);
	for(auto i : cnt){
		if(i.second >= B){
			sum[i.first] = vector<pi>(n);
			rec(0, 0, 0, 0, i.first);
		}
	}
	
	for(auto i : in){
		if(cnt[get<2>(i)] < B) se[get<2>(i)].emplace_back(i);
	}
	
	while(q--){
		int x, y, u, v; cin >> x >> y >> u >> v; u--; v--;
		
		int m = lca(u, v); dbg(m);
		pi a = calc(u, m, -1), b = calc(v, m, -1);
		pi c = calc(u, m, x), d = calc(v, m, x);
		
		int ans = a.second + b.second - c.second - d.second;
		ans += (c.first + d.first) * y;
		cout << ans << endl;
	}
	
	return 0;
}

Measured memory_bytes: 64236