#include <bits/stdc++.h>

using namespace std;
ifstream fin("zvon.in");
ofstream fout("zvon.out");
const int NMAX = 100005;
vector < int> G[NMAX];
int v[NMAX];
int dfs(int nod){
    v[nod] = 1;
    int mx = 0;
    for(int i = 0; i < G[nod].size(); i++){
        if(v[G[nod][i]] == 0){
            int t = dfs(G[nod][i]);
            if(t > mx)
                mx = t;
            fout << v[nod] <<" ";
            v[nod]++;
        }
    }
    fout << mx <<" ";

        v[nod] += mx - 1;
    return v[nod];
}
int main()
{
    int n,t,x,y;
    fin >> t;
    for(int i = 1; i <= t; i++){
        fin >> n;
        for(int j  = 1; j <= n - 1; j++){
            fin >> x >> y;
            G[x].push_back(y);
        }
        for(int j  = 1; j <= n; j++)
            sort(G[j].begin(),G[j].end());
        fout << dfs(1) << "\n";
        for(int j  = 1; j <= n; j++){
            G[j].clear();
            v[j] = 0;
        }

    }
    return 0;
}