#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int i,j,m,n,p,k,fa[305],vis[305],dis[305],mp[305][305];
int Min(int n){
        int ans=1000000000;
        for(int i=1;i<=n;i++) fa[i]=i;
        while(n>1){
                int last=1;
                memset(vis,0,sizeof(vis));
                memset(dis,0,sizeof(dis));
                vis[fa[1]]=1;
                for(int i=2;i<=n;i++){
                    int k=-1;
                    for(int 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); 
        while(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");
        }
}