// Problem: G. Subgraph Isomorphism
// Contest: Codeforces - The 2022 ICPC Asia Hangzhou Regional Programming Contest
// URL: https://codeforces.com/gym/104090/problem/G
// Memory Limit: 1024 MB
// Time Limit: 3000 ms

/*
hxz还是爬的好
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define wt int tt=d;while(tt--)
#define py puts("YES")
#define pn puts("NO")
#define pritnf printf
#define edfl endl
#define fe(i,e) for(int i=0;i<e.size();i++)
#define vi vector<ll>
inline ll rd() {
	ll x=0,f=1;
	char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c))x=x*10+c-'0',c=getchar();
	return x*f;
}
namespace binom{
	const ll Lim=300010,mod=998244353;
	ll jc[Lim],inv[Lim],inc[Lim];
	void pre(){
		jc[0]=jc[1]=inc[0]=inc[1]=inv[0]=inv[1]=1;
		f(i,2,Lim-1)jc[i]=jc[i-1]*i%mod,inv[i]=(mod-mod/i)*inv[mod%i]%mod,
		inc[i]=inc[i-1]*inv[i]%mod;
	}ll C(ll n,ll m){if(n<0||m<0||n<m)return 0;return jc[n]*inc[m]%mod*inc[n-m]%mod;}
}
// using namespace binom;
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
#define d rd()
#define pb push_back
// const ll N=300010;
// struct edge{ll v,w,nx;}e[N<<1];
// ll hd[N],cnt;
// void add(ll u,ll v,ll w){e[++cnt]=(edge){v,w,hd[u]};hd[u]=cnt;}
ll qp(ll a,ll b,ll p){
	ll ans=1;while(b){
		if(b&1)ans=ans*a%p;
		a=a*a%p;b>>=1;
	}return ans;
}ll n,m;
vi e[100010];
bool fl[100010];
ll in[100010];
queue<ll>q;
#define ull unsigned ll
ull f[100010];
ull rep[100010];
ull h[100010];
vi ee[100010];
ll sz[100010];
ll mn,g1,g2,no;
void gsz(ll u,ll fa){
	no++;sz[u]=1;fe(i,e[u]){
		ll v=e[u][i];if(v==fa||!fl[v])continue;
		gsz(v,u);sz[u]+=sz[v];
	}
}
void getg(ll u,ll fa){ll mx=0;
	fe(i,e[u]){
		ll v=e[u][i];if(v==fa||!fl[v])continue;
		getg(v,u);mx=max(mx,sz[v]);
	}mx=max(mx,no-sz[u]);
	if(mx<mn)mn=mx,g1=u,g2=-1;
	else if(mx==mn)g2=u;
}void dfs(ll u,ll fa){
	sz[u]=1;f[u]=1;
	fe(i,e[u]){
		ll v=e[u][i];if(v==fa||!fl[v])continue;
		// cout<<u<<" "<<v<<endl;
		dfs(v,u);sz[u]+=sz[v];
		f[u]+=f[v]*rep[sz[v]];
	}
	// cout<<u<<" "<<f[u]<<endl;
}
ll lp[100010],c;
bool gg[100010];
void gl(ll u){if(gg[u])return;
	lp[++c]=u;gg[u]=1;
	fe(i,e[u]){
		ll v=e[u][i];if(fl[v]||gg[v])continue;
		gl(v);break;
	}
}
int main(){srand(time(0));
	wt{
		n=d,m=d;f(i,1,n)rep[i]=((ll)rand()<<30)+((ll)rand()<<15)+rand();
		f(i,1,n)e[i].clear(),fl[i]=0,in[i]=0,lp[i]=0,gg[i]=0;
		f(i,1,m){
			ll u=d,v=d;
			e[u].pb(v),e[v].pb(u);
			in[u]++,in[v]++;
			// if(u==5&&v==12)cout<<"qwqqwqwqwqwqw\n";
			// if(v==5&&u==12)cout<<"qwqqwqwqwqwqw\n";
		}if(m==n-1){py;continue;}
		if(m>n){pn;continue;}
		// f(i,1,n){cout<<i<<":";
			// fe(j,e[i])cout<<e[i][j]<<" ";cout<<endl;
		// }
		f(i,1,n)if(in[i]==1)q.push(i);
		while(!q.empty()){
			ll u=q.front();q.pop();
			if(fl[u])continue;fl[u]=1;
			// cout<<u<<endl;
			fe(i,e[u]){
				ll v=e[u][i];
				if(in[v]&&(--in[v])==1)q.push(v);
			}
		}c=0;
		// f(i,1,n)cout<<fl[i];cout<<endl;
		f(i,1,n)if(!fl[i]){
			gl(i);break;
		}
		//f(i,1,c)cout<<lp[i]<<" ";cout<<endl;
		f(i,1,c){
			dfs(lp[i],0);h[i]=f[lp[i]];
			// cout<<lp[i]<<" "<<f[lp[i]]<<" "<<h[i]<<endl;
			
			// cout<<lp[i]<<" "<<g1<<" "<<g2<<" "<<x<<" "<<y<<endl;
		}bool fp=1;
		if(c&1){f(i,2,c)if(h[i]!=h[1])fp=0;}
		else{//cout<<c<<endl;
			f(i,3,c){
				if(h[i]!=h[(i&1)?1:2])fp=0;
				// cout<<h[i].first<<" "<<h[i].second<<endl
			}
		}
		if(fp)py;else pn;
	}
	return 0;
}
/*
wy还是爬的好
*/