#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define clr(x,y) memset(x,y,sizeof(x))
#define in(a) a=read()
#define out(a) printf("%d\n",a)
inline ll read(){
    char c=getchar();ll f=1,x=0;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();
    return x*f;
}
#define mod 1000000007
void MOD(int &x){if(x>=mod)x-=mod;}
#define maxn 310
#define inf (1<<30)

int a[maxn][maxn],d[maxn];
int id[maxn];
bool cmp(int a,int b){return d[a]<d[b];} 
int main(){
    int t;
    in(t);
    while(t--){
        int n,m,k;
        in(n);in(m);in(k);
        int flag=0;
        if(m<(n-1)*k)flag=1;
        FOR(i,1,n)d[i]=0;
        FOR(i,1,n)
            FOR(j,1,n)
                a[i][j]=0;
        FOR(i,1,m){
            int x,y;
            in(x);in(y);
            a[x][y]++;a[y][x]++;
            d[x]++;d[y]++;
        }
        FOR(i,1,n)if(d[i]<k){flag=1;break;}
        FOR(i,1,n)id[i]=i;
        while(k){
            sort(id+1,id+n+1,cmp);
            int f=0;
            FOR(i,1,n){
                int x=id[i];
                int F=0;
                FORD(j,n,i+1){
                    int y=id[j];
                    if(a[x][y]){
                        a[x][y]--;a[y][x]--;
                        d[x]--;d[y]--;
                        F=1;
                        break;
                    }
                }
                if(!F)f++;
            }
            if(f>1)break;
            k--;
        }
        if(flag)puts("No");
        else puts("Yes");
    }
}