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

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-7;
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
#define INF INFINITY
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

//========================================================================//

class Ancestor {
private:
	int n;
	vvi lst;
	vvi table;
	vi from;
	vi visited, departed;
	deque<int> deq;
	void dfs(int a, int &t) {
		for (int i = 0; i < deq.size(); i = i * 2 + 1) {
			table[a].push_back(deq[i]);
		}
		visited[a] = t++;
		deq.push_front(a);
		Foreach(b, lst[a]) {
			if (from[b] == INT_MIN) {
				from[b] = a;
				dfs(b, t);
			}
		}
		deq.pop_front();
		departed[a] = t++;
	}
public:
	Ancestor(const vvi &lst, vi roots = { 0 }) {
		n = lst.size();
		this->lst = lst;
		table = vvi(n);
		from = vi(n, INT_MIN);
		visited.resize(n);
		departed.resize(n);
		int t = 0;
		Foreach(root, roots) {
			from[root] = -1;
			dfs(root, t);
		}
	}
	// if (des == anc) -> return false
	bool is_ancestor(int des, int anc) {
		return visited[anc] < visited[des]
			&& departed[des] < departed[anc];
	}
	int lowest_common_ancestor(int x, int y) {
		if (x == y) return x;
		if (is_ancestor(x, y)) return y;
		if (is_ancestor(y, x)) return x;
		Loop1(i, table[x].size() - 1) {
			if (is_ancestor(y, table[x][i])) {
				return lowest_common_ancestor(table[x][i - 1], y);
			}
		}
		return lowest_common_ancestor(table[x].back(), y);
	}
	int get_ancestor(int des, int k) {
		if (k == 0) return des;
		int l = int(log2(k));
		if (l >= table[des].size()) return -1;
		else return get_ancestor(table[des][l], k - (1 << l));
	}
	// return first value causing "t" in evalfunc that returns descendant->[f,...,f,t,...,t]->root
	// NOTE: if [f,...,f] then return -1
	template<typename bsargv_t>
	int upper_bsearch(int des, const bsargv_t &v, bool(*evalfunc)(int, const bsargv_t&)) {
		if (evalfunc(des, v)) return des;
		if (table[des].size() == 0) return -1;
		Loop1(i, table[des].size() - 1) {
			if (evalfunc(table[des][i], v)) {
				return upper_bsearch(table[des][i - 1], v, evalfunc);
			}
		}
		return upper_bsearch(table[des].back(), v, evalfunc);
	}
	// return last value causing "t" in evalfunc that returns descendant->[t,...,t,f,...,f]->root
	// NOTE: if [f,...,f] then return -1
	template<typename bsargv_t>
	int lower_bsearch(int des, const bsargv_t &v, bool(*evalfunc)(int, const bsargv_t&)) {
		if (!evalfunc(des, v)) return -1;
		if (table[des].size() == 0) return des;
		Loop(i, table[des].size()) {
			if (!evalfunc(table[des][i], v)) {
				if (i == 0) return des;
				else return lower_bsearch(table[des][i - 1], v, evalfunc);
			}
		}
		return lower_bsearch(table[des].back(), v, evalfunc);
	}
};

Ancestor *anc;
int n;
vvi childs;
vvi childs_eid;

vvi lst;
vvi lst_eid;
struct edge_t {
	int clr;
	ll dst;
	int a, b;
};
vector<edge_t> edges;

vi from;
vll node_dst;

vvi clr_eid;
vvi frqclr_cnt;
vvll frqclr_dst;

void dfs(int a) {
	Loop(i, lst[a].size()) {
		int b = lst[a][i];
		int b_eid = lst_eid[a][i];
		if (from[b] == INT_MIN) {
			from[b] = a;
			childs[a].push_back(b);
			childs_eid[a].push_back(b_eid);
			node_dst[b] = node_dst[a] + edges[b_eid].dst;
			dfs(b);
		}
	}
}

void dfs_clr(int c, int a) {
	Loop(i, childs[a].size()) {
		int b = childs[a][i];
		int b_eid = childs_eid[a][i];
		frqclr_cnt[c][b] = frqclr_cnt[c][a] + (edges[b_eid].clr == c ? 1 : 0);
		frqclr_dst[c][b] = frqclr_dst[c][a] + (edges[b_eid].clr == c ? edges[b_eid].dst : 0);
		dfs_clr(c, b);
	}
}

int main() {
	quickio();
	cin >> n;
	childs = vvi(n);
	childs_eid = vvi(n);
	lst = vvi(n);
	lst_eid = vvi(n);
	from = vi(n, INT_MIN);
	node_dst = vll(n);
	frqclr_cnt = vvi(n);
	frqclr_dst = vvll(n);
	clr_eid = vvi(n);
	int q; cin >> q;
	Loop(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		int c; cin >> c;
		ll d; cin >> d;
		edges.push_back({ c, d, a, b });
		lst[a].push_back(b);
		lst_eid[a].push_back(i);
		lst[b].push_back(a);
		lst_eid[b].push_back(i);
		clr_eid[c].push_back(i);
	}
	anc = new Ancestor(lst);
	from[0] = -1;
	dfs(0);
	int th = ceilsqrt(n);
	Loop(i, n) {
		if (clr_eid[i].size() >= th) {
			frqclr_cnt[i] = vi(n);
			frqclr_dst[i] = vll(n);
			dfs_clr(i, 0);
		}
	}
	Loop(_, q) {
		int x, u, v;
		ll y;
		cin >> x >> y >> u >> v; u--; v--;
		if (clr_eid[x].size() >= th) {
			int w = anc->lowest_common_ancestor(u, v);
			ll org = node_dst[u] + node_dst[v] - node_dst[w] * 2;
			ll dif = frqclr_dst[x][u] + frqclr_dst[x][v] - frqclr_dst[x][w] * 2;
			ll upd = (frqclr_cnt[x][u] + frqclr_cnt[x][v] - frqclr_cnt[x][w] * 2) * y;
			ll ans = org - dif + upd;
			cout << ans << endl;
		}
		else {
			int w = anc->lowest_common_ancestor(u, v);
			ll org = node_dst[u] + node_dst[v] - node_dst[w] * 2;
			ll dif = 0;
			ll upd = 0;
			Foreach(eid, clr_eid[x]) {
				bool upper_than_u = (anc->is_ancestor(u, edges[eid].a) || u == edges[eid].a) && (anc->is_ancestor(u, edges[eid].b) || u == edges[eid].b);
				bool upper_than_v = (anc->is_ancestor(v, edges[eid].a) || v == edges[eid].a) && (anc->is_ancestor(v, edges[eid].b) || v == edges[eid].b);
				if ((upper_than_u && !upper_than_v) || (!upper_than_u && upper_than_v)) {
					dif += edges[eid].dst;
					upd += y;
				}
			}
			ll ans = org - dif + upd;
			cout << ans << endl;
		}
	}
}

Measured memory_bytes: 57520