#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>

using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define R pair<pair<int, int>, pair<int, int>>
#define S(i,j,k,l) mkp(mkp(i,j),mkp(k,l))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)
#define range(i,v) for(auto& (i) : v)
#define mkp make_pair
#define mem(x,k) memset(x,k,sizeof(x))
#define vec vector
#define pb emplace_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==n-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define itn int
#define pri_que priority_queue
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define pppp(x,y,z,w) pb(S(x,y,z,w))
#define cyes cout<<"Yes\n"
#define cno cout<<"No\n"
#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
	if (!fact_[0]) {
		fact_[0] = 1; comp_[0] = 1;
		for (int i = 1; i < fn_; i++)
			fact_[i] = fact_[i - 1] * i % Mod;
		comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
		for (int i = fn_ - 2; i > 0; i--)
			comp_[i] = comp_[i + 1] * (i + 1) % Mod;
	}
	if (x < y) return 0;
	return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
class RSQ {
#define H pair<int, int>
	int n, rr;
	H dat[500000];
	const int inf = 294 * 1e6;
public:
	void init(int size) {
		n = size, rr = 1;
		while (rr < n) rr *= 2;
		for (int i = 0; i < 500000; i++) dat[i] = H{ 0,inf };
	}
	void update(int a, int b, int x) {
		update_(0, a, b, 0, rr, x);
	}
	int query(int a, int b) {
		return query_(0, a, b, 0, rr);
	}
private:
	void eval(int i, int l, int r) {
		if (dat[i].sc == inf) return;
		if (r - l > 1) {
			dat[i * 2 + 1].sc = dat[i * 2 + 2].sc = dat[i].sc;
		}
		dat[i].fs = (min(r, n) - l) * dat[i].sc;
		dat[i].sc = inf;
	}
	void update_(int i, int a, int b, int l, int r, int x) {
		eval(i, l, r);
		if (b <= l || r <= a) return;
		if (a <= l && r <= b) {
			dat[i].sc = x;
			eval(i, l, r);
			return;
		}
		update_(i * 2 + 1, a, b, l, (l + r) / 2, x);
		update_(i * 2 + 2, a, b, (l + r) / 2, r, x);
		dat[i].fs = dat[i * 2 + 1].fs + dat[i * 2 + 2].fs;
	}
	int query_(int i, int a, int b, int l, int r) {
		eval(i, l, r);
		if (b <= l || r <= a) return 0;
		if (a <= l && r <= b) return dat[i].fs;
		return query_(i * 2 + 1, a, b, l, (l + r) / 2) +
			query_(i * 2 + 2, a, b, (l + r) / 2, r);
	}
};
template<typename T>
class HLD {
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define fs first
#define sc second
#define xx fs
#define yy sc.fs
#define zz sc.sc
	int n;
	vector<int>e[MXN];
	vector<P>(*f);
	T seg;
	int par[300000], dep[300000], hev[300000], head[300000], pos[300000];
public:
	void init(int size, vector<P>(&ff)) {
		f = &ff;
		n = size;
		for (int i = 0; i < size - 1; i++) {
			e[(*f)[i].xx].push_back((*f)[i].yy);
			e[(*f)[i].yy].push_back((*f)[i].xx);
		}
		dfs(0, -1, 0);
		int idx = 0;
		for (int i = 0; i < n; i++) {
			if (~par[i] && hev[par[i]] == i) continue;
			for (int j = i; ~j; j = hev[j]) {
				head[j] = i;
				pos[j] = idx++;
			}
		}
		seg.init(n);
		for (int i = 0; i < n - 1; i++) {
			if (dep[(*f)[i].xx] < dep[(*f)[i].yy]) swap((*f)[i].xx, (*f)[i].yy);
			seg.update(pos[(*f)[i].xx], pos[(*f)[i].xx] + 1, (*f)[i].zz);
		}
	}
	int getquery(int a, int b) {
		int ret = 0;
		while (head[a] != head[b]) {
			if (dep[head[a]] < dep[head[b]]) swap(a, b);
			ret += seg.query(pos[head[a]], pos[a] + 1);
			a = par[head[a]];
		}
		if (dep[a] > dep[b]) swap(a, b);
		return ret + seg.query(pos[a] + 1, pos[b] + 1);
	}
	void update(int a, int b, int x) {
		while (head[a] != head[b]) {
			if (dep[head[a]] < dep[head[b]]) swap(a, b);
			seg.update(pos[head[a]], pos[a] + 1, x);
			a = par[head[a]];
		}
		if (dep[a] > dep[b]) swap(a, b);
		seg.update(pos[a] + 1, pos[b] + 1, x);
	}
private:
	int dfs(int v, int p, int d) {
		par[v] = p; dep[v] = d; hev[v] = -1;
		int ma = 0, sum = 1;
		for (int i = 0; i < e[v].size(); i++) {
			int to = e[v][i];
			if (to == p) continue;
			int tmp = dfs(to, v, d + 1);
			if (ma < tmp) {
				ma = tmp;
				hev[v] = to;
			}
			sum += tmp;
		}
		return sum;
	}
};
HLD<RSQ> hld1, hld2;
//個数、コスト
int n, q;
int ans[200000];
vec<R>edg;
vec<pair<H, pair<H, int>>>que;
vec<P>uu1, uu2;
vec<int>c[200000];
signed main() {
	cin >> n >> q;
	rep(i, n - 1) {
		int a, b, cc, d; cin >> a >> b >> cc >> d;
		a--; b--;
		edg.pppp(a, b, cc, d);
		uu1.ppp(a, b, d);
		uu2.ppp(a, b, 0);
		c[cc].pb(i);
	}
	hld1.init(n, uu1);
	hld2.init(n, uu2);
	rep(i, q) {
		int a, b, c, d; cin >> a >> b >> c >> d;
		c--; d--;
		que.pb(mkp(mkp(a, b), mkp(mkp(c, d), i)));
		//色、コスト、頂点s
	}
	sort(all(que));
	for (int i = 0; i < q;) {
		int j = i;
		//色iの辺のコストを全部消す
		//色iの辺の個数を数える
		for (auto k : c[que[i].fs.fs]) {
			hld1.update(edg[k].fs.fs, edg[k].fs.sc, 0);
			hld2.update(edg[k].fs.fs, edg[k].fs.sc, 1);
		}
		while (j < q && que[i].fs.fs == que[j].fs.fs) {
			int a = que[j].sc.fs.fs, b = que[j].sc.fs.sc;
			int sum = hld2.getquery(a, b) * que[j].fs.sc;
			sum += hld1.getquery(a, b);
			ans[que[j].sc.sc] = sum;
			j++;
		}
		for (auto k : c[que[i].fs.fs]) {
			hld1.update(edg[k].fs.fs, edg[k].fs.sc, edg[k].sc.sc);
			hld2.update(edg[k].fs.fs, edg[k].fs.sc, 0);
		}
		i = j;
	}
	rep(i, q) printf("%lld\n", ans[i]);
}

Measured memory_bytes: 101648