#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
struct DSU {
    std::vector<int> f, siz;
    
    DSU() {}
    DSU(int n) {
        init(n);
    }
    
    void init(int n) {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
    
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    
    int size(int x) {
        return siz[find(x)];
    }
};
void solve() {
    int n, m;
    std::cin >> n >> m;
    
    std::vector<std::vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    std::vector<int> p(n), invp(n);
    std::iota(p.begin(), p.end(), 0);
    std::sort(p.begin(), p.end(),
        [&](int i, int j) {
            return adj[i].size() < adj[j].size();
        });
    for (int i = 0; i < n; i++) {
        invp[p[i]] = i;
    }
    
    std::vector<std::vector<int>> a(n);
    DSU dsu(n);
    std::vector<bool> vis(n);
    i64 e = 0;
    for (auto x : p) {
        for (auto y : adj[x]) {
            if (invp[y] < invp[x] && !vis[y]) {
                vis[y] = true;
                a[x].push_back(y);
                e += dsu.size(y);
                dsu.merge(x, y);
            }
        }
        for (auto y : adj[x]) {
            if (invp[y] < invp[x]) {
                if (dsu.find(y) != x) {
                    std::cout << "No\n";
                    return;
                }
            }
        }
    }
    if (e != m) {
        std::cout << "No\n";
        return;
    }
    std::cout << "Yes\n";
    for (auto x : p) {
        std::cout << x + 1 << " " << a[x].size();
        for (auto y : a[x]) {
            std::cout << " " << y + 1;
        }
        std::cout << "\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}