#include<iostream>#include<cstring>#include<map>#include<algorithm>#include<stack>#include<queue>#include<cmath>#include<string>#include<cstdlib>#include<vector>#include<cstdio>#include<set>#include<list>#include<numeric>#include<cassert>#include<ctime>#include<bitset>using namespace std;const int INF = 1000000000;const int MAXN = 1010;vector<int> E[MAXN];vector<vector<int> > leaf[MAXN];bool cmp(int a, int b){ int len = min(leaf[a].size(), leaf[b].size()); for(int i = 0; i < len ; i ++) { if(leaf[a][i] != leaf[b][i]){ return leaf[a][i] < leaf[b][i]; } } return leaf[a].size() > leaf[b].size();}void dfs(int u){ leaf[u].clear(); if(E[u].empty()){ leaf[u].push_back(vector<int>()); return; } for(vector<int>::iterator it = E[u].begin(); it != E[u].end() ; it++) { dfs(*it); } sort(E[u].begin(), E[u].end(), cmp); int label = 0; for(vector<int>::iterator it = E[u].begin(); it != E[u].end() ; it++, label ++) { for(vector<vector<int> >::iterator jt = leaf[*it].begin(); jt != leaf[*it].end();jt++){ jt->insert(jt->begin(), label); leaf[u].push_back(*jt); } leaf[*it].clear(); }}int main(){ int line = 0; int T, n, q; int u,v; for (scanf("%d", &T); T--; ) { scanf("%d%d", &n,&q); for (int i = 0 ; i < n ; i ++) { E[i].clear(); } for (int i = 1; i < n; i ++) { scanf("%d%d", &u, &v); E[u].push_back(v); } dfs(0); vector<vector<int> > &ans = leaf[0]; while(q--){ scanf("%d", &u); u--; if(u >= ans.size()) { puts("Out of range."); }else { for(int i = 0; i < ans[u].size() ; i++) { if(i > 0){ printf(" "); } printf("%d", ans[u][i]); } puts(""); } } puts(""); } return 0;}
