#include<bits/stdc++.h>
#define int long long
#define N 100005
using namespace std;
int T;
int n,m,k;
int a[N];
int x[N],t[N];
int vis[N],viss[N];
int cnt;
vector<int> g[N],f[N],e;
void bfs(int s){
    queue<int> q;
    q.push(s);
    cnt=0;
    viss[s]=1;
    e.push_back(s);
    while(!q.empty()){
        int x=q.front();
        q.pop();if(vis[x]) continue;
        for(int i:g[x]){
            if(viss[i]) continue;
            f[x].push_back(i);
            viss[i]=++cnt;
            e.push_back(i);
            q.push(i);
        }
    }
}
void sol(){
    for(int i=1;i<=n;i++) g[i].clear(),f[i].clear(),vis[i]=viss[i]=0;
    e.clear();
    scanf("%lld %lld %lld",&n,&m,&k);
    for(int i=1,x;i<=k;i++){
        scanf("%lld",&x);
        vis[x]=1;
    }
    for(int i=1,u,v;i<=m;i++){
        scanf("%lld %lld",&u,&v);
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            bfs(i);
            break;
        }
    }
    int s=0;
    for(int i=1;i<=n;i++){
        if(!viss[i]){
            printf("No\n");
            return;
        }
        if(f[i].size()) s++;
    }
    printf("Yes\n");
    printf("%lld\n",s);
    for(int i:e){
        if(!f[i].size()) continue;
        printf("%lld %lld ",i,(int)f[i].size());
        for(int j:f[i]) printf("%lld ",j);
        printf("\n");
    }
}
signed main(){
    // scanf("%lld",&T);
    T=1;
    while(T--) sol();
    return 0;
}