#include<bits/stdc++.h>
using namespace std;


void solve(){
	int N,M;cin>>N>>M;
	vector<int>D(N);
	vector<pair<int,int>>E(M);
	for(auto&[u,v]:E){
		cin>>u>>v;
		u--;
		v--;
		D[u]++;
		D[v]++;
	}
	vector<int>idx(N);
	iota(idx.begin(),idx.end(),0);
	sort(idx.begin(),idx.end(),[&](int a,int b){
		if(D[a]!=D[b])return D[a]<D[b];
		return a<b;
	});
	vector<vector<int>>G(N);
	for(auto[u,v]:E){
		if(D[u]>D[v]||(D[u]==D[v]&&u>v))swap(u,v);
		G[v].push_back(u);
	}

	vector<int>par(N),sz(N);
	for(int i=0;i<N;i++){
		par[i]=i;
		sz[i]=1;
	}
	auto find=[&](auto&&find,int x)->int{
		if(par[x]==x)return x;
		return par[x]=find(find,par[x]);
	};
	auto merge=[&](int x,int y)->void{
		x=find(find,x);
		y=find(find,y);
		if(x==y)return;
		if(sz[x]<sz[y])swap(x,y);
		sz[x]+=sz[y];
		par[y]=x;
	};

	vector<pair<int,vector<int>>>ans;
	for(int i:idx){
		vector<int>me;
		for(int nxt:G[i])me.push_back(find(find,nxt));
		for(int nxt:G[i])merge(i,nxt);
		if(sz[find(find,i)]-1!=G[i].size()){
			cout<<"No\n";
			return;
		}
		sort(me.begin(),me.end());
		me.erase(unique(me.begin(),me.end()),me.end());
		ans.push_back({i,me});
	}

	cout<<"Yes\n";
	for(auto[x,v]:ans){
		cout<<x+1<<' ';
		cout<<v.size()<<' ';
		for(int y:v)cout<<y+1<<' ';
		cout<<'\n';
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T;cin>>T;
	while(T--){
		solve();
	}
}