#include <bits/stdc++.h>
using namespace std;
#define int long long
array<int, 3> exgcd(int a, int b) {
	if (!b) return {a, 1, 0};
	auto [g, y, x] = exgcd(b, a % b);
	y -= a / b * x;
	return {g, x, y};
}
int solve(int m1, int a1, int m2, int a2) {
	a1 = (a1 % m1 + m1) % m1;
	a2 = (a2 % m2 + m2) % m2;
	auto [g, p, q] = exgcd(m1, m2);
	assert(g);
	if ((a2 - a1) % g) return 1e18;
	p *= (a2 - a1) / g, q *= (a2 - a1) / g;
	q *= -1;
	while (p < 0 || q < 0) p += m2 / g, q += m1 / g;
	while (p >= m2 / g) p -= m2 / g, q -= m1 / g;
	assert(p * m1 + a1 == q * m2 + a2);
	return p * m1 + a1;
}
void solve() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> e(n);
	for (int i = 0, u, v; i < n - 1; i++) {
		cin >> u >> v;
		u--;
		v--;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	vector<vector<int>> dis(n, vector<int>(n, -1));
	for (int S = 0; S < n; S++) {
		dis[S][S] = 0;
		static queue<int> q;
		q.push(S);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			for (int v : e[u]) {
				if (dis[S][v] == -1) {
					dis[S][v] = dis[S][u] + 1;
					q.push(v);
				}
			}
		}
	}
	while (m--) {
		int sa, ta, sb, tb;
		cin >> sa >> ta >> sb >> tb;
		sa--, ta--, sb--, tb--;
		int da = dis[sa][ta], db = dis[sb][tb], ans = 1e18, ansid = -2;
		for (int i = 0; i < n; i++) {
			if (dis[i][sa] + dis[i][ta] == da && dis[i][sb] + dis[i][tb] == db) {
				int t = 1e18;
				t = min(t, solve(da * 2, dis[i][sa], db * 2, dis[i][sb]));
				t = min(t, solve(da * 2, da * 2 - dis[i][sa], db * 2, dis[i][sb]));
				t = min(t, solve(da * 2, dis[i][sa], db * 2, db * 2 - dis[i][sb]));
				t = min(t, solve(da * 2, da * 2 - dis[i][sa], db * 2, db * 2 - dis[i][sb]));
				if (t < ans) {
					ans = t;
					ansid = i;
				}
			}
		}
		cout << ansid + 1 << "\n";
	}
}
signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}