#include <bits/stdc++.h>
#define ll long long
using namespace std;

namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(!isalpha(ch)) ch = getc();
		while(isalpha(ch)) s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 2e5 + 10;
const ll inf = 1e15;
int n, q, m, p[N];
ll a[N], b[N];
struct edge {
	int to, w, nxt;
} e[N << 1];
vector<int> E[N];
int head[N], ecnt;
void addedge(int u, int v, int w) {
	e[++ecnt] = {v, w, head[u]};
	head[u] = ecnt;
}
int S, T, fa[N], dfn[N], dep[N], tim;
ll dis[N], mx[N], sec[N], mxid[N], dis2[N];
bool vis[N];
void dfs0(int u, int f) {
	if(dis[u] > dis[S]) S = u;
	for(int i = head[u], v; i; i = e[i].nxt) {
		v = e[i].to;
		if(v == f) continue;
		E[u].push_back(v);
		dis[v] = dis[u] + e[i].w;
		dfs0(v, u);
	} 
}
int top[N];
void dfs(int u, int f) {
	dep[u] = dep[f] + 1, fa[u] = f, dfn[u] = ++tim;
	for(int i = head[u], v; i; i = e[i].nxt) {
		v = e[i].to;
		if(v == f) continue;
		dfs(v, u);
	}
}
bool cmp(int x, int y) { return dfn[x] < dfn[y]; }
int L[N], R[N];
namespace st_table {
	int st[20][N];
	inline int Min(int u, int v) { return dep[u] < dep[v] ? u : v; } 
	void init() {
		for(int i = 1; i <= n; i++)
			st[0][dfn[i]] = i;
		for(int i = 1; (1 << i) <= n; i++)
			for(int j = 1; j + (1 << i) - 1 <= n; j++)
				st[i][j] = Min(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
	}
	inline int query(int l, int r) {
		int L = 31 ^ __builtin_clz(r - l + 1);
		return Min(st[L][l], st[L][r - (1 << L) + 1]);
	}
} using namespace st_table;
inline int LCA(int u, int v) {
	if(u == v) return u;
	if(dfn[u] > dfn[v]) swap(u, v);
	return fa[query(dfn[u] + 1, dfn[v])];
}
inline ll Dis(int u, int v) { return dis[u] + dis[v] - 2 * dis[LCA(u, v)]; }
void dfs2(int u, int id) {
	top[u] = id;
	L[u] = u, R[u] = u;
	for(int i = head[u], v; i; i = e[i].nxt) {
		v = e[i].to;
		if(vis[v] || v == fa[u]) continue;
		dfs2(v, id);
		int tmp[4] = {L[u], R[u], L[v], R[v]};
		for(int i = 0; i < 4; i++)
			for(int j = i + 1; j < 4; j++)
				if(Dis(tmp[i], tmp[j]) > Dis(L[u], R[u])) L[u] = tmp[i], R[u] = tmp[j];
		if(mx[v] + e[i].w > mx[u]) sec[u] = mx[u], mx[u] = mx[v] + e[i].w, mxid[u] = v;
		else sec[u] = mx[v] + e[i].w;
	}
}
struct ST_table {
	ll st[20][N];
	void init(ll *a, int n) {
		for(int i = 1; i <= n; i++)
			st[0][i] = a[i];
		for(int i = 1; (1 << i) <= n; i++)
			for(int j = 1; j + (1 << i) - 1 <= n; j++)
				st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
	}
	inline ll query(int l, int r) {
		int L = 31 ^ __builtin_clz(r - l + 1);
		return max(st[L][l], st[L][r - (1 << L) + 1]);
	}
} s1, s2;
inline int get(int u, int v) { return *--upper_bound(E[u].begin(), E[u].end(), v, cmp); }
vector<pair<ll, ll>> t[N << 2];
#define ls x << 1
#define rs x << 1 | 1
inline bool check(pair<ll, ll> a, pair<ll, ll> b, pair<ll, ll> c) {
	return (b.second - c.second) * (a.first - c.first) <= (a.second - c.second) * (b.first - c.first);
}
void build(int x, int l, int r) {
	t[x].push_back({0ll, 0ll});
	if(l == r) return;
	ll res = -1e9;
	for(int i = l; i <= r; i++) {
//		assert(b[i] >= 0);
		if(i != l) {
			while(t[x].size() > 1 && check(make_pair(res, b[i]), t[x].back(), t[x][t[x].size() - 2])) t[x].pop_back();
			t[x].push_back(make_pair(res, b[i]));
		}
		res = max(res, a[i]); 
	}
	int mid = l + r >> 1;
	build(ls, l, mid);
	build(rs, mid + 1, r);
}
ll query(int x, int l, int r, int L, int R, ll A, ll B) {
	if(L <= l && r <= R) {
		ll res = -1e14;
		if(L < l) res = max(res, A * s1.query(L, l - 1) + B * s2.query(l, r));
		if(t[x].size() < 2) return res;
		int curl = 1, curr = t[x].size() - 1, mid, ans;
		while(curl <= curr) {
//			cerr << curl << " "<< curr <<endl;
			mid = curl + curr >> 1;
			assert(mid >= 1 && mid <= t[x].size() - 1);
//			cerr << A << " " << t[x][mid].first <<" " << B <<" " << t[x][mid].second << endl;
			if(A * t[x][mid].first + B * t[x][mid].second > A * t[x][mid - 1].first + B * t[x][mid - 1].second)
				ans = mid, curl = mid + 1;
			else curr = mid - 1;                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                 
		}
		return max(res, A * t[x][ans].first + B * t[x][ans].second);
//		return res; 
	}
	ll res = -1e14;
	int mid = l + r >> 1;
	if(mid >= L) res = max(res, query(ls, l, mid, L, R, A, B));
	if(mid < R) res = max(res, query(rs, mid + 1, r, L, R, A, B));
	return res;
}
int main() {
//	if(system("fc my.out path1.out")) return 0;
//	freopen("path1.in", "r", stdin);
//	freopen("my.out", "w", stdout);
	n = read(), q = read();
	for(int i = 1, u, v, w; i < n; i++) {
		u = read(), v = read(), w = read();
		addedge(u, v, w);
		addedge(v, u, w);
	}
	dfs0(1, 0);
	T = S, S = 0;
	memset(dis, 0, sizeof(dis));
	dfs0(T, 0);
	swap(S, T);
	dfs(S, 0);
	init();
	int t = T;
	while(t) { p[++m] = t; vis[t] = 1; t = fa[t]; }
	reverse(p + 1, p + 1 + m);
	for(int i = 1; i <= m; i++)
		dfs2(p[i], i);
	for(int i = 1; i <= m; i++)
		a[i] = dis[p[i]] + mx[p[i]];
	s1.init(a, m);
	for(int i = m - 1; i; i--)
		dis2[p[i]] = dis2[p[i + 1]] + dis[p[i + 1]] - dis[p[i]];
	for(int i = 1; i <= m; i++)
		b[i] = dis2[p[i]] + mx[p[i]];
	s2.init(b, m);
	build(1, 1, m);
//	return 0;
	while(q--) {
		ll ans = 0;
		int u = read(), v = read();
		ll A = read(), B = read();
		if(top[u] == top[v]) {
			int f = LCA(u, v);
			if(u == f) {
				ll a = max(Dis(u, S), Dis(u, T));
				int t = get(u, v);
				ll b = max(Dis(v, L[t]), Dis(v, R[t]));
				ans = max(ans, a * A + b * B);
			}
			else if(v == f) {
				ll a = max(Dis(v, S), Dis(v, T));
				int t = get(v, u);
				ll b = max(Dis(u, L[t]), Dis(u, R[t]));
				ans = max(ans, b * A + a * B);
			}
			else {
				int lca = LCA(u, v);
				ll a1 = max(Dis(u, S), Dis(u, T));
				ll a2 = max(Dis(v, S), Dis(v, T));
				ll b1 = 0, b2 = 0;
				int t1 = get(lca, u), t2 = get(lca, v);
				b1 = max(Dis(u, L[t1]), Dis(u, R[t1]));
				b2 = max(Dis(v, L[t2]), Dis(v, R[t2]));
				ans = max({ans, a1 * A + b2 * B, b1 * A + a2 * B});
			}
		}
		else {
			int f1 = top[u], f2 = top[v];
			if(f1 > f2) swap(f1, f2), swap(u, v), swap(A, B);
			int fa1 = p[f1], fa2 = p[f2];
			int t1, t2;
			if(fa1 != u) t1 = get(fa1, u);
			else t1 = u;
			if(fa2 != v) t2 = get(fa2, v);
			else t2 = v;
			ll b1 = max(Dis(u, L[t1]), Dis(u, R[t1]));
			ll b2 = max(Dis(v, L[t2]), Dis(v, R[t2]));
			ans = A * b1 + B * b2;
			if(u != fa1) ans = max(ans, A * b1 + B * max(Dis(v, S), Dis(v, T)));
			if(v != fa2) ans = max(ans, A * max(Dis(u, S), Dis(u, T)) + B * b2);
			ll c1 = dis[u] - dis[fa1], c2 = dis[v] - dis[fa2];
			if(mxid[fa1] == t1) c1 += sec[fa1];
			else c1 += mx[fa1];
			if(mxid[fa2] == t2) c2 += sec[fa2];
			else c2 += mx[fa2];
			c1 = max(c1, Dis(u, S)), c2 = max(c2, Dis(v, T));
			ans = max(ans, A * c1 + B * c2);
			if(f1 + 1 <= f2 - 1) ans = max(ans, A * c1 + B * (s2.query(f1 + 1, f2 - 1) - dis2[fa2] + dis[v] - dis[fa2]));
			if(f1 + 1 <= f2 - 1) ans = max(ans, A * (s1.query(f1 + 1, f2 - 1) - dis[fa1] + dis[u] - dis[fa1]) + B * c2);
//			ll X = -1e9;
			if(f1 + 1 <= f2 - 1) ans = max(ans, query(1, 1, m, f1 + 1, f2 - 1, A, B) + A * dis[u] - 2 * A * dis[fa1] + B * dis[v] - B * dis2[fa2] - B * dis[fa2]);
//			for(int i = f1 + 1; i <= f2 - 1; i++) {
//				if(i != f1 + 1) ans = max(ans, A * (X - dis[fa1] + dis[u] - dis[fa1]) + B * (dis2[p[i]] + mx[p[i]] - dis2[fa2] + dis[v] - dis[fa2]));
//				X = max(X, dis[p[i]] + mx[p[i]]);
//			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}