#include <bits/stdc++.h>
using namespace std;
const int maxn=200005;
int read(){
    int ret=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
    while( isdigit(ch)){ret=(ret<<3)+(ret<<1)+(ch&15);ch=getchar();}
    return ret*f;
}
int n,m,k,s,tot; 
vector<int> G[maxn],son[maxn];
int dfn[maxn],id[maxn];
bool dwn[maxn],vis[maxn];
void DFS(int now){
    vis[now]=1;
    if(dwn[now]) return ;
    dfn[now]=++tot;
    id[tot]=now;
    for(auto s:G[now]){
        if(vis[s]) continue;
        DFS(s);
        son[now].push_back(s);
    }
}
int main(){
    n=read(),m=read(),k=read();
    for(int i=1;i<=k;++i){
        dwn[read()]=1;
    }
    for(int i=1;i<=m;++i){
        int u=read(),v=read();
        G[u].push_back(v);
        G[v].push_back(u);
    }
    for(int i=1;i<=n;++i){
        if(!dwn[i]){
            s=i;
            break;
        }
    }
    DFS(s);
    for(int i=1;i<=n;++i){
        if(!vis[i]){
            printf("No\n");
            return 0;
        }
    }
    printf("Yes\n%d\n",tot);
    for(int i=1;i<=tot;++i){
        int now=id[i];
        printf("%d ",now);
        printf("%d ",son[now].size());
        for(auto s:son[now]) printf("%d ",s);
        printf("\n");
    }
    return 0;
}