#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <random>
#include<list> 
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define lowbit(x) ((x)&(-x))
ll extend_gcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n, ll mod)
{
    ll ans = 1;
    a %= mod;
    while (n)
    {
        if (n & 1)
            ans = (ans * a) % mod; //% mod
        a = (a * a) % mod;         //% mod
        n >>= 1;
    }
    return ans;
}

inline void write(__int128 x)
{
    if (x > 9)
    {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
__int128 sqrt(__int128 m)
{
    __int128 leftt = 0, rightt = ((__int128)1) << 51, ret = -1, mid;
    while (leftt < rightt)
    {
        mid = (leftt + rightt) / 2;
        if (mid * mid > m)
        {
            rightt = mid;
        }    
        else
        {
            leftt = mid + 1;
            ret = mid;
        }
    }
    return ret;
}

const double eps = 1e-6;
int sgn(double x)
{
    if(fabs(x)<eps)
    {
        return 0;
    }
    else return x<0?-1:1;
}

struct Point
{
    double x,y;
    Point()
    {

    }
    Point(double x,double y):x(x),y(y)
    {

    }
    Point operator + (Point B)
    {
        return Point(x+B.x,y+B.y);
    }
    Point operator - (Point B)
    {
        return Point(x-B.x,y-B.y);
    }
    bool operator == (Point B)
    {
        return sgn(x-B.x)==0&&sgn(y-B.y)==0;
    }
    bool operator < (Point B)
    {
        return sgn(x-B.x)<0||(sgn(x-B.x)==0&&sgn(y-B.y)<0);
    }
};
typedef Point Vector;
double Cross(Vector A,Vector B)//叉积
{
    return A.x*B.y-A.y*B.x;
}
double Distance(Point A,Point B)
{
    return hypot(A.x-B.x,A.y-B.y);
}
int Convex_hull(Point *p,int n,Point *ch)
{
    n=unique(p,p+n)-p;
    sort(p,p+n);
    int v=0;

    for(int i=0;i<n;i++)
    {
        while (v>1&&sgn(Cross(ch[v-1]-ch[v-2],p[i]-ch[v-1]))<=0)
        {
            v--;
        }
        ch[v++]=p[i];
    }

    int j=v;

    for(int i=n-2;i>=0;i--)
    {
        while (v>j&&sgn(Cross(ch[v-1]-ch[v-2],p[i]-ch[v-1]))<=0)
        {
            v--;
        }
        ch[v++]=p[i];
    }
    if(n>1)
    {
        v--;
    }
    return v;
}

int kmp(string s, string p)
{
    int ans = 0, lastt = -1;
    int lenp = p.size();
    vector<int > Next(lenp+3,0);
    rep(i, 1, lenp - 1)
    {
        int j = Next[i];
        while (j && p[j] != p[i])
        {
            j = Next[j];
        }
        if (p[j] == p[i])
        {
            Next[i + 1] = j + 1;
        }
        else
        {
            Next[i + 1] = 0;
        }
    }
    int lens = s.size();
    int j = 0;
    rep(i, 0, lens - 1)
    {
        while (j && s[i] != p[j])
        {
            j = Next[j];
        }
        if (s[i] == p[j])
        {
            j++;
        }
        if (j == lenp)
        {
            ans++;
        }
    }
    return ans;
}

int dir[4][2] =
    {
        {-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // 左右上下
// int dir[8][2]={
//         {-1, 0}, {0, 1}, {1, 0}, {0, -1},{-1,-1},{-1,1},{1,-1},{1,1}
// };
        
#define endl '\n'//交互题请删除本行
const ll inf = 1000000000000000000ll;
const ll mod1 = 998244353ll, P1 = 131, mod2 = 1e9 + 7ll, P2 = 13331;
ll inverse(ll x)
{
    return fastpow(x,mod1-2,mod1);
}

const int N = 1e6 + 10, M = 1e6 + 10;

///////////////////////////////////

int tt;

int n,m;


vector<int > v[N];
bool vis[N];
int d[N];
vector<int > huan;

struct node
{
    int depth,num;
    node(int a,int b)
    {
        depth=a;
        num=b;
    }
};
vector<pii> vv[N],vvv[N];

int geshu[N];

ll dp[N];

///////////////////////////////////

bool cmp(int x,int y)
{
    return d[x]<d[y];
}

void yu(int u)
{
    huan.pb(u);
    vis[u]=1;
    for(auto i:v[u])
    {
        if(vis[i]==0)
        {
            yu(i);
        }
    }
}

void dfs(int u,int depth,int lishu)
{
    vis[u]=1;
    ll num=0;
    geshu[u]=1;
    for(auto i:v[u])
    {
        if(vis[i]==0)
        {
            num++;
            dfs(i,depth+1,lishu);
            geshu[u]++;
            dp[u]*=dp[i];
            dp[u]%=mod1;
        }
    }
    vv[lishu].pb({depth,num});
    vvv[lishu].pb({depth,geshu[u]});
    dp[u]*=P1;
    dp[u]%=mod1;
}

bool judge()
{
    for(auto i:huan)
    {
        sort(vv[i].begin(),vv[i].end());
        sort(vvv[i].begin(),vvv[i].end());
    }
    bool ret=1;
    vector<pii > temp1=vv[huan[0]],temp2=vv[huan[1]],temp3=vvv[huan[0]],temp4=vvv[huan[1]];
    ll zhi1=dp[huan[0]],zhi2=dp[huan[1]];
    for(auto i:huan)
    {
        if(vv[i]!=temp1||vvv[i]!=temp3||dp[i]!=zhi1)
        {
            ret=0;
            break;
        }
        
    }
    if(ret)
    {
        return 1;
    }

    if(huan.size()%2==0)
    {
        int id=1;
        for(auto i:huan)
        {
            id^=1;
            if(id==0&&(vv[i]!=temp1 ||vvv[i]!=temp3 ||dp[i]!=zhi1  )||id==1&&(vv[i]!=temp2||vvv[i]!=temp4||dp[i]!=zhi2))
            {
                return 0;
            }
        }

        return 1;
    }
    return 0;

}

///////////////////////////////////

void init()
{
    rep(i,1,n)
    {
        v[i].clear();
        vv[i].clear();
        vvv[i].clear();
    }
    rep(i,1,n)
    {
        vis[i]=0;
    }
    fill(d+1,d+n+1,0);
    huan.clear();
    rep(i,1,n)
    {
        dp[i]=1;
    }
}

///////////////////////////////////

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);//交互题请删除本行
   // freopen("ain.txt", "r", stdin); freopen("aout.txt", "w", stdout);
 //   
    cin>>tt;
    rep(ii,1,tt)
    {
        cin>>n>>m;
        // if(tt==10416&&ii==1397)
        // {
        //     cout<<n<<" "<<m<<endl;
        // }
        
        init();
        rep(i,1,m)
        {
            int x,y;
            cin>>x>>y;
            if(tt==10416&&ii==1397&&i>=51)
            {
                cout<<x<<" "<<y<<endl;
            }
            v[x].pb(y);
            v[y].pb(x);
            d[x]++;
            d[y]++;
        }

        if(tt==10416)
        {
            continue;
        }

        //tree
        if(m==n-1)
        {
            cout<<"YES"<<endl;
            continue;
        }
        //more 
        if(m>n)
        {
            cout<<"NO"<<endl;
            continue;
        }

        queue<int > q;
        rep(i,1,n)
        {
            if(d[i]==1)
            {
                q.push(i);
            }
        }

        while (q.size())
        {
            int u=q.front();
            vis[u]=1;
            q.pop();
            for(auto i:v[u])
            {
                d[i]--;
                if(d[i]==1)
                {
                    q.push(i);
                }
            }
        }

        
        
        rep(i,1,n)
        {
            if(vis[i]==0)
            {
                vis[i]=1;
                yu(i);
                break;
            }
        }

        fill(vis+1,vis+n+1,0);
        for(auto i:huan)
        {
            vis[i]=1;
        }

        for(auto i:huan)
        {
           
            dfs(i,0,i);
        }



        bool flag=judge();
        if(flag)
        {
            cout<<"YES";
        }
        else
        {
            cout<<"NO";
        }
        cout<<endl;


    }
    
    


    return 0;
}