// بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
// In the Name of Allah, the Beneficent, the Merciful.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define vi vector<int>
#define vl vector<long long>
#define ll long long
#define F first
#define S second
#define pii pair<int,int>
#define inv(a) for(auto &it : a) cin >> it;
#define outv(a) for(auto &it : a) cout << it << " ";cout<<"\n"
#define outv1(a) for(auto &it : a) cout << it << " "<<"\n";cout<<"\n"
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define inf 1e9
// #define double long double
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define int long long




void solve(int tc) {
    int n,q;
    cin>>n>>q;
    vl tr[n+1];
    for (int i = 0; i < n; i++)
    {
        int  u,v;
        cin>>u>>v;
        tr[u].pb(v);
        tr[v].pb(u);
    }

    vl vis(n+1, 0);
    vl level(n+1, 0);
    queue<int> qu;
    qu.push(1);
    vis[1]=1;

    while (!qu.empty())
    {
        int now = qu.front();
        qu.pop();
        // vis[now]=1;
        for(auto &it: tr[now]) {
            if(!vis[it]) {
                qu.push(it);
                vis[it]=1;
                level[it]=level[now]+1;
            }
        }
    }
    level.erase(level.begin());
    sort(all(level));
    int lo = -1,hi=0;
    for (int i = 1; i <= n; i++)
    {
        int x = upper_bound(all(level), i)-level.begin();
        cout<<x<<" ";
    }
    cout<<endl;
}

int32_t main() {
    fastio;
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif
    
    int tc=1;
    cin>>tc;
    for (int i = 1; i <= tc; i++)
    {
        solve(i);
    }
    
    return 0;
}