#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<ctime>
#include<set>
#include<vector>
#include<map>
#include<queue>

#define N 305
#define M 8000005

#define ls (t<<1)
#define rs ((t<<1)|1)
#define mid ((l+r)>>1)

#define mk make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

int i,j,m,n,p,k,fa[N],vis[N],dis[N],mp[N][N];

int Min(int n)
{
        int ans=(int)1e9,i,j,k;
        for (i=1;i<=n;++i) fa[i]=i;
        for (;n>1;)
        {
                int k=0,last=1;
                memset(vis,0,sizeof(vis));
                memset(dis,0,sizeof(dis));
                vis[fa[1]]=1;
                for (i=2;i<=n;++i) 
                {
                    k=-1;
                    for (j=2;j<=n;++j)
                        if (!vis[fa[j]])
                        {
                            dis[fa[j]]+=mp[fa[last]][fa[j]];
                            if (k==-1||dis[fa[k]]<dis[fa[j]]) k=j;
                        }
                    vis[fa[k]]=1;
                    if (i==n)
                    {
                            ans=min(ans,dis[fa[k]]);
                            for (j=1;j<=n;++j)    
                            {
                                    mp[fa[last]][fa[j]]+=mp[fa[j]][fa[k]];
                                    mp[fa[j]][fa[last]]+=mp[fa[j]][fa[k]];
                            }
                            fa[k]=fa[n--];
                    }
                    last=k;
                }
        }
        return ans;
}

int main()
{
        int T;
        scanf("%d",&T); 
        for (;T--;)
        {
                scanf("%d%d%d",&n,&m,&k);
                memset(mp,0,sizeof(mp));
                for (;m--;)
                {
                        int x,y;
                        scanf("%d%d",&x,&y);
                        mp[x][y]++,mp[y][x]++; 
                }
                if (Min(n)>=k) puts("Yes");
                else puts("No");
        }
}