1 #include <cstdio>
  2 #include <iostream>
  3 #include <vector>
  4 #include <map>
  5 #include <string>
  6 #include <cstring>
  7 using namespace std;
  8 const int MAX_N = 100005;
  9 const int MAX_M = 100005;
 10
 11 int vis[MAX_N];
 12 int ans[MAX_N];
 13 int ans_tar[MAX_N];//每组查询的目标目录
 14 int indeg[MAX_N];
 15 int depth[MAX_N];
 16 map<string, int> name;
 17 vector<int> G[MAX_N];//邻接表，边不带权
 18 vector<int> query_tar[MAX_N];
 19 vector<int> query_id[MAX_N];
 20 int par[MAX_N];
 21
 22 int T;
 23 int n, m;
 24 int seq_num;//目录名的序列号，从1开始
 25
 26 void init(){
 27     seq_num = 1;
 28     memset(vis, 0, sizeof(vis));
 29     memset(ans, 0, sizeof(ans));
 30     memset(ans_tar, 0, sizeof(ans_tar));
 31     memset(indeg, 0, sizeof(indeg));
 32     memset(depth, 0, sizeof(depth));
 33     name.clear();
 34     for(int i=0; i<MAX_N; i++){
 35         G[i].clear();
 36         query_tar[i].clear();
 37         query_id[i].clear();
 38         par[i] = i;
 39     }
 40 }
 41 int find(int x){
 42     return par[x]==x ? x : par[x] = find(par[x]);
 43 }
 44 void unite(int x, int y){
 45     x = find(x);
 46     y = find(y);
 47     if(x==y) return ;
 48     par[y] = x;
 49 }
 50
 51 void dfs(int r, int l){
 52     //cout << "dfs " << r << endl;
 53     vis[r] = 1;
 54     depth[r] = l;
 55     for(int i=0; i<G[r].size(); i++){
 56         //cout << G[r][i] << endl;
 57         if(vis[G[r][i]]) continue;
 58         dfs(G[r][i], l+1);
 59         unite(r, G[r][i]);
 60     }
 61     for(int i=0; i<query_tar[r].size(); i++){
 62         if(!vis[query_tar[r][i]]) continue;
 63         int cur, tar;
 64         int ans_id = query_id[r][i];//这一查询所持的序列号
 65         int real_tar = ans_tar[ans_id];//这一个查询真正指定的target
 66         if(r == real_tar){//当前r是目标
 67             cur = query_tar[r][i];
 68             tar = real_tar;
 69         }else{//已访问过的那个点是目标
 70             cur = r;
 71             tar = real_tar;
 72         }
 73         //cout << "query " << cur << tar << endl;
 74         int ca = find(query_tar[r][i]);
 75         if(tar == ca) ans[ans_id] = depth[cur] - depth[ca];
 76         else if(cur == ca) ans[ans_id] = 1;
 77         else ans[ans_id] = depth[cur] - depth[ca] + 1;
 78     }
 79 }
 80
 81 void lca(int r){
 82     //cout << "root " << r << endl;
 83     dfs(r, 0);
 84 }
 85
 86 int main()
 87 {
 88     freopen("4547.txt", "r", stdin);
 89     scanf("%d", &T);
 90     while(T--){
 91         init();
 92         scanf("%d%d", &n, &m);
 93         for(int i=0; i<n-1; i++){
 94             string c, p;
 95             cin>>c;
 96             int u = name[c];//不存在会自动插入并置value为0
 97             if(u==0){
 98                 u = name[c] = seq_num++;
 99             }
100
101             cin>>p;
102             int v = name[p];
103             if(v==0){
104                 v = name[p] = seq_num++;
105             }
106             G[u].push_back(v);
107             G[v].push_back(u);
108             indeg[u]++;//入度为0的是根目录
109         }
110         // for(map<string, int>::iterator iter = name.begin();
111         //     iter != name.end(); iter++){
112         //     cout << iter->first << iter->second << endl;
113         // }
114         for(int i=0; i<m; i++){
115             string cur, tar;
116             cin >> cur >> tar;
117             int u = name[cur];
118             int v = name[tar];
119             query_tar[u].push_back(v);
120             query_tar[v].push_back(u);
121             query_id[u].push_back(i);//tar和id是同步记录的
122             query_id[v].push_back(i);
123             ans_tar[i] = v;//为辨谁是目标目录
124         }
125         for(map<string, int>::iterator iter = name.begin();
126             iter != name.end(); iter++){
127             int id = iter->second;
128             if(indeg[id] == 0){
129                 lca(id);
130                 break;
131             }
132         }
133         for(int i=0; i<m; i++){
134             printf("%d\n", ans[i]);
135         }
136     }
137     return 0;
138 }