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

void exgcd(int a, int b, int &g, int &x, int &y) {
  if (!b) {
    g = a;
    x = 1, y = 0;
    return;
  }
  exgcd(b, a % b, g, y, x);
  y -= a / b * x;
}

const int N = 3e3 + 5;
int n, m;
vector<int> G[N], rs[2][N];

int tp, st[N], ins[N];
int da, db;
void dfs(int u, int tar, int s, int typ) {
  st[++tp] = u, ins[u] = 1;
  if (u == tar) {
    if (typ == 0 && !da) da = tp - 1;
    if (typ == 1 && !db) db = tp - 1; 
    for (int i = 1; i <= tp - 1; i++) {
      int v = st[i];
      rs[typ][v].push_back(s);
      s++;
    }
  } else {
    for (auto v : G[u]) if (!ins[v]) {
      dfs(v, tar, s, typ);
    }
  }
  ins[u] = 0, tp--;
}

void solve() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    G[i].clear();
  }
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= m; i++) {
    int sa, ta, sb, tb;
    cin >> sa >> ta >> sb >> tb;
    da = 0;
    db = 0;
    dfs(sa, ta, 0, 0);
    dfs(sb, tb, 0, 1);
    dfs(ta, sa, da, 0);
    dfs(tb, sb, db, 1);
    int ans = 1e9, id;
    da *= 2;
    db *= 2;
    for (int u = 1; u <= n; u++) {
      for (auto x : rs[0][u]) for (auto y : rs[1][u]) {
        int c = y - x;
        int g, t, r;
        exgcd(da, db, g, t, r);
        if (c % g) continue;
        t *= c / g;
        t = (t % (db / g) + (db / g)) % (db / g);
        if (x + t * da < ans) {
          ans = x + t * da;
          id = u;
        }
      }
    }
    if (ans == int(1e9)) cout << -1 << "\n";
    else cout << id << "\n";
    for (int u = 1; u <= n; u++) {
      for (int j : {0, 1}) {
        rs[j][u].clear();
      }
    }
  }
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}