#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//const ll INF=1e18;
const int maxn=305;
const int INF=0x3f3f3f3f;
int t,n,m,k,x,y;
int mapp[maxn][maxn];
int in[maxn],out[maxn];
int main() {
    cin>>t;
    while (t--) {
        memset(in,0,sizeof(in));
        cin>>n>>m>>k;
        for (int i=0; i<m; i++) {
            cin>>x>>y;
            mapp[x][y]=1;
            mapp[y][x]=1;
            in[x]++;
            in[y]++;
        }
        int flag=0;
        for (int i=1; i<=n; i++) {
            if (in[i]<k||in[i]==0) {
               flag=1;
               break;
            }
        }
        if (flag==1){
            cout<<"No"<<endl;
        }else cout<<"Yes"<<endl;
    }
}