#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <string>
#include <iostream>
using namespace std;inline int read() {int x = 0, f = 1; char ch = getchar();while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }return x * f;
}
const int N = 1e5 + 10;
struct Edge { int v, next; } edge[N];
int n, m, cnt, head[N], fa[N], degree[N], lca[N][17], dep[N];
bool vis[N];
map<string, int> mp;
int tol;inline void init() { memset(head, 0, sizeof(head));memset(fa, 0, sizeof(fa));memset(vis, 0, sizeof(vis));memset(degree, 0, sizeof(degree));memset(lca, 0, sizeof(lca));cnt = tol = 0;mp.clear();
}inline void addedge(int u, int v) {edge[++cnt].v = v; edge[cnt].next = head[u]; head[u] = cnt;
}int index(string s) {if (mp.find(s) != mp.end()) return mp[s];return mp[s] = ++tol;
}void dfs(int u) {vis[u] = 1;lca[u][0] = fa[u];for (int i = 1; i <= 16; i++) lca[u][i] = lca[lca[u][i-1]][i-1];for (int i = head[u]; i; i = edge[i].next) {int v = edge[i].v;if (vis[v]) continue;dep[v] = dep[u] + 1;fa[v] = u;dfs(v); }
}int Lca(int u, int v) {if (dep[u] < dep[v]) swap(u, v);for (int i = 16; i >= 0; i--) if (dep[lca[u][i]] >= dep[v]) u = lca[u][i];if (u == v) return u;for (int i = 16; i >= 0; i--) if (lca[u][i] != lca[v][i]) u = lca[u][i], v = lca[v][i];return lca[u][0];
}int main() {int T = read();while (T--) {init();n = read(); m = read();for (int i = 0; i < n - 1; i++) {string a, b;cin >> a >> b;int u = index(a), v = index(b);addedge(v, u);degree[u]++;}int root = 0;for (int i = 1; i <= n; i++) if (!degree[i]) { root = i; break; }fa[root] = root;dfs(root);while (m--) {string a, b;cin >> a >> b;int u = index(a), v = index(b);int r = Lca(u, v);printf("%d\n", dep[u] - dep[r] + (v == r ? 0 : 1));}}  return 0;
}

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <string>
#include <iostream>
using namespace std;inline int read() {int x = 0, f = 1; char ch = getchar();while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }return x * f;
}
const int N = 1e5 + 10;
struct Edge { int v, next; } edge[N];
int cnt, head[N];
inline void addedge(int u, int v) {edge[++cnt].v = v; edge[cnt].next = head[u]; head[u] = cnt;
}
struct Qedge { int v, next, num; } qedge[N * 2];
int qcnt, qhead[N];
inline void addqedge(int u, int v, int num) {qedge[++qcnt].v = v;qedge[qcnt].next = qhead[u];qhead[u] = qcnt;qedge[qcnt].num = num;
}
int n, m, fa[N], degree[N], dep[N];
int ans[N];
bool vis[N];
map<string, int> mp;
int tol;inline void init() { memset(head, 0, sizeof(head));memset(qhead, 0, sizeof(qhead));memset(fa, 0, sizeof(fa));memset(vis, 0, sizeof(vis));memset(degree, 0, sizeof(degree));memset(dep, 0, sizeof(dep));memset(ans, 0, sizeof(ans));cnt = qcnt = tol = 0;mp.clear();
}int getfa(int x) { return x == fa[x] ? x : fa[x] = getfa(fa[x]); }int index(string s) {if (mp.find(s) != mp.end()) return mp[s];return mp[s] = ++tol;
}void dfs(int u) {fa[u] = u;vis[u] = 1;for (int i = head[u]; i; i = edge[i].next) {int v = edge[i].v;if (vis[v]) continue;dep[v] = dep[u] + 1;dfs(v);fa[v] = u;}for (int i = qhead[u]; i; i = qedge[i].next) {int v = qedge[i].v;if (vis[v]) {ans[qedge[i].num] = getfa(v);}}
}int main() {int T = read();while (T--) {init();n = read(); m = read();for (int i = 0; i < n - 1; i++) {string a, b;cin >> a >> b;int u = index(a), v = index(b);addedge(v, u);degree[u]++;}int root = 0;for (int i = 1; i <= n; i++) if (!degree[i]) { root = i; break; }for (int i = 1; i <= m; i++) {string a, b;cin >> a >> b;int u = index(a), v = index(b);addqedge(u, v, i);addqedge(v, u, i);}dep[root] = 0;dfs(root);for (int i = 1; i <= m; i++) {int u = qedge[2 * i].v, v = qedge[2 * i - 1].v;printf("%d\n", dep[u] - dep[ans[i]] + (ans[i] == v ? 0 : 1));}}return 0;
}