// https://www.youtube.com/watch?v=CrymicX875M
// Angel of mercy
// How did you move me
// Why am I on my feet again

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

void solve() {
    int n, m; cin >> n >> m;
    bool feas = true;
    vector<vector<int>> adj(n);
    vector<int> deg(n);
    for (int i = 0; i < m; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
        deg[u]++; deg[v]++;
    }
    auto oadj = adj;
    priority_queue<pair<int, int>> q;
    for (int i = 0; i < n; i++) {
        q.emplace(deg[i], i);
    }
    vector<int> vis(n);
    vector<int> ans;
    while (!q.empty()) {
        auto [sz, u] = q.top(); q.pop();
        if (sz != deg[u]) continue;
        vis[u] = 1; ans.push_back(u);
        for (int v: adj[u]) vis[v] = 1;
        for (int v: adj[u]) {
            vector<int> nadj;
            for (int w: adj[v]) {
                if (!vis[w]) {
                    cout << "No\n";
                    return;
                }
                if (w != u) nadj.push_back(w);
            }
            adj[v].swap(nadj);
        }
        for (int v: adj[u]) {
            deg[v]--;
            vis[v] = 0;
            q.emplace(deg[v], v);
        }
        deg[u] = 0;
        adj[u].clear();
    }

    class UnionFindSet {
        vector<int> fa, sz;

    public:
        UnionFindSet(int n) : fa(n), sz(n, 1) {
            for (int i = 0; i < n; i++) {
                fa[i] = i;
            }
        }

        int size(int x) { return sz[find(x)]; }

        int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }

        int merge(int x, int y) {
            x = find(x), y = find(y);
            if (x == y) return 0;
            if (sz[x] < sz[y]) swap(x, y);
            fa[y] = x, sz[x] += sz[y];
            return 1;
        }
    };
    cout << "Yes\n";
    vis.assign(n, 0);
    reverse(ans.begin(), ans.end());
    UnionFindSet ufs(n);
    for (int x: ans) { 
        cout << x + 1 << " ";
        vector<int> tmp;
        for (int y: oadj[x]) {
            if (!vis[y]) continue;
            if (ufs.find(y) != ufs.find(x)) {
                ufs.merge(x, y);
                tmp.push_back(y);
            }
        }
        cout << tmp.size() << " ";
        for (int y: tmp) cout << y + 1 << " ";
        cout << "\n";
        vis[x] = 1;
    }
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    };
}