#include<bits/stdc++.h>
using namespace std;
int n; int t; int bfs[100010]; int vist[100010];
struct node { vector listx; };
int main() { cin>>t; while(t--) { cin>>n; node mapt[n+1]; memset(vist,0,sizeof(vist)); memset(bfs,0,sizeof(bfs)); for(int i=1;i<n;i++) { int x,y; cin>>x>>y; mapt[x].listx.push_back(y); mapt[y].listx.push_back(x); } vist[1]=1; bfs[1]=1; int p=1; int r=1; while(p<=r) {
}
}
return 0;
}