// Problem: D - Subgraph Isomorphism
// Contest: Virtual Judge - 过什么520做题要紧
// URL: https://vjudge.net/contest/559671#problem/D
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Date:2023-05-20 07:53:15
// By:SmallBlack
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
	long long s=0,k=1;
	char c=getchar();
	while(!isdigit(c))
	{
		k=(c=='-')?-1:1;
		c=getchar();
	}
	while(isdigit(c))
	{
		s=s*10+c-'0';
		c=getchar();
	}
	return s*k;
}
#define d read()
#define ll long long
#define Maxn 10010
#define Size 10010
#define mp make_pair
#define pb push_back
#define fi first
#define se second
vector<ll>e[Size];
void solve()
{
	ll n=d,m=d;
	for(int i=1;i<=n;i++) e[i].clear();
	for(int i=0;i<m;i++)
	{
		ll x=d,y=d;
		e[x].pb(y),e[y].pb(x);
	}
	if(m==n-1) return (void)puts("YES");
	else if(m>n) return (void)puts("NO");
	else puts("YES");
}
int main()
{
	ll t=d;
	while(t--) solve();
}