1900分图论：1133F2 思维+并查集+构造 固定根为k的生成树

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 200005;
int T, n, m ,d, k = 0;
set <int> s;
vector <int> edge[N];
vector <pair<int,int> > ans;
int fa[N], fa2[N], vis[N];
map <pair<int,int>,int>ma;
int findroot(int x)
{
    if(fa[x] == x)
        return x;
    return fa[x] = findroot(fa[x]);
}
void merge(int x, int y)
{
    int fax = findroot(x);
    int fay = findroot(y);
    if(fax != fay)
        fa[fax] = fay;
}
int findroot2(int x)
{
    if(fa2[x] == x)
        return x;
    return fa2[x] = findroot2(fa2[x]);
}
bool merge2(int x, int y)
{
    int fax = findroot2(x);
    int fay = findroot2(y);
    if(fax != fay)
    {
        fa2[fax] = fay;
        return true;
    }
    return false;
}
vector <int> block[N];
void kruskal()
{
    int tot = 0;
    for (auto it : ans)
        merge2(it.fi, it.se), tot += 1;
    for (int i = 2 ; i <= n ; i ++)
        for (auto v : edge[i])
            if(v != 1 && merge2(i,v))
                ans.pb(mk(i, v)), tot += 1;
    if(tot != n-1)
    {
        cout << "NO" <<endl;
        exit(0);
    }
}
int main(void)
{
    CLOSE;
    cin >> n >> m >> d;
    for (int i = 1 ; i <= n ; i ++)
        fa[i] = i, fa2[i] = i;
    int cnt = 0;
    for (int i = 1 ; i <= m ; i ++)
    {
        int u , v;
        cin >> u >> v;
        if(u == 1 || v == 1)
            cnt += 1;
        edge[u].pb(v);
        edge[v].pb(u);
        ma[mk(u,v)] = 1;
        ma[mk(v,u)] = 1;
    }
    if(cnt < d)
    {
        cout << "NO" << endl;
        return 0;
    }
    for (int i = 2 ; i <= n ; i ++)
        for (auto v : edge[i])
            if(v != 1)
                merge(i, v);
    for (int i = 2 ; i <= n ; i ++) {
        fa[i] = findroot(i);
        block[fa[i]].pb(i);
        s.insert(fa[i]);
    }
    if(s.size() > d)
    {
        cout << "NO" << endl;
        return 0;
    }
    for (int i = 2 ; i <= n ; i ++)
    {
        for (auto v : block[i])
        {
            if(ma[mk(1,v)])
            {
                ans.pb(mk(1, v)), vis[v] = 1;
                d -= 1;
                break;
            }
        }
    }
    for (int i = 2 ; i <= n ; i ++)
    {
        if(d == 0)
            break;
        if (!vis[i] && ma[mk(1,i)])
            ans.pb(mk(1, i)), d -= 1;
    }
    kruskal();
    cout << "YES" << endl;
    for (auto it : ans)
        cout << it.fi << ' ' << it.se << endl;
}