1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 20
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
    return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
    return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
    return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
    return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os<<"{"<<p.ff<<", "<<p.ss<<"}";
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (size_t i = 0; i < v.size(); ++i) {
        if (i) os << ", ";
        os << v[i];
    }
    os << "}";
    return os;
}
template<ll MOD=998244353>
struct mint_t{
    ll x;
    mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
    mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
    mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
    mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
    mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
    mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
    mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
    mint_t fp(ll y)const{
        mint_t a=1,b=x;
        while(y){
            if(y&1)a*=b;
            b*=b;
            y/=2;
        }
        return a;
    }
    mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
    mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
    ll x;
    in>>x;
    a=mint_t<MOD>(x);
    return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
    out<<a.x;
    return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
    if(b>a || a<0)return 0;
    return fct[a]/fct[b]/fct[a-b];
}
vi g[1001],g2[1001];
ll dg[1001];
ll il[1001],il2[1001];
ll war[1001];
bool vs[1001];
void solve(){
    ll n,a,b;
    cin>>n;
    vi pr;
    vi mn;
    for(ll i=0;i<n-2;i++)mn.pb(n);
    for(ll i=1;i<=n;i++){g2[i].clear();g[i].clear();il[i]=0;}
    for(ll i=1;i<n;i++){
        cin>>a>>b;g2[a].pb(b);g2[b].pb(a);
    }
    ll ak=1;
    map<ll,ll>mp;
    for(ll i=1;i<=n;i++){
        if(g2[i].size()==1){
            
        }
        else{
            mp[i]=ak++;
        }
    }
    for(ll i=1;i<=n;i++){
        if(g2[i].size()==1){
            il[mp[g2[i][0]]]++;
        }
        for(ll j:g2[i]){
            if(g2[j].size()>1)g[mp[i]].pb(mp[j]);
            
        }
    }
    for(ll i=1;i<=n;i++){
        if(il[i])pr.pb(i);
    }
    ll no=n;
    n=ak-1;
    for(ll i=1;i<=n;i++){
      //  if(g[i].size())cout<<g[i]<<" "<<il[i]<<endl;
    }
    for(ll i=0;i<fct[n].x;i++){
        next_permutation(al(pr));
        vi v=pr;
        for(ll j=1;j<=n;j++)war[j]=-1;
        ak=1;
        vi prufer;
        priority_queue<pii,vii,greater<pii>>pq;
        for(ll j=1;j<=n;j++){
            il2[j]=il[j];
            vs[j]=0;
            dg[j]=g[j].size();
        }
        
        //cout<<v<<endl;
        for(ll j=0;j<no-2;j++){
            ll x;
            if(pq.size()){
                x=pq.top().ss;
            //cout<<x<<" ";
                pq.pop();
            }
            else{
                //cout<<v.back()<<". ";
                if(il2[v.back()]){
                    il2[v.back()]--;
                    if(war[v.back()]==-1)
                    war[v.back()]=ak++;
                  //  cout<<war[v.back()]<<" "<<v.back()<<endl;
                    prufer.pb(war[v.back()]);
                    continue;
                }
                x=v.back();
                v.pop_back();
                if(war[x]==-1)
                war[x]=ak++;
                if(dg[x]!=1){j--;
                    continue;
                }
            }
            //cout<<x<<" ";
            vs[x]=1;
            for(ll k:g[x]){
               // cout<<k<<" "<<dg[k]<<endl;
                if(war[k]==-1)war[k]=ak++;
                if(--dg[k]==1)pq.push({war[k],k});
                if(!vs[k]){
                    prufer.pb(war[k]);
                    for(ll m=0;il2[k] && j+1<no-2;m++){
                        j++;
                       // cout<<k<<", ";
                        il2[k]--;
                        prufer.pb(war[k]);

                    }
                }
            }
            
        }
        //cout<<prufer;
        mn=min(mn,prufer);
      //  cout<<pr<<" "<<prufer<<endl;
    }
    for(ll i:mn)cout<<i<<" ";cout<<"\n";
}
int main(){
    ios_base::sync_with_stdio(0);
    fct[0]=1;
    for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
    ll t=1;
    cin>>t;
    for(ll i=1;i<=t;i++){
        //cout<<"Case #"<<i<<": ";
        solve();
    }
}