#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<functional>
#include<utility>
#include<cassert>
using namespace std;
inline long long read(){
    long long x = 0,f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-') f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = (x << 3) + (x << 1) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
const int N = 2e5 + 11;
const int M = 5e5 + 11;
int n,m,k,cnt,tt,head[N],ecnt = -1,id[N];
bool flag[N],vis[N];
vector<int> v[N];
queue<int> Q;
struct yjx{
    int nxt,to;
}e[M << 1];
inline void save(int x,int y){
    e[++ecnt] = (yjx){head[x],y};
    head[x] = ecnt;
}
void dfs(int now){
    int i,temp;
    //if(vis[now]) return;
    ++cnt;
    vis[now] = 1;
    for(i = head[now];~i;i = e[i].nxt){
        temp = e[i].to;
        if(vis[temp]) continue;
        else if(flag[temp]) ++cnt,vis[temp] = 1;
        else dfs(temp);
    }
}
void bfs(int s){
    int i,now,temp;
    Q.push(s);
    while(!Q.empty()){
        now = Q.front();
        Q.pop();
        if(vis[now]) continue;
        vis[now] = 1;
        id[++tt] = now;
        for(i = head[now];~i;i = e[i].nxt){
            temp = e[i].to;
            if(vis[temp]) continue;
            v[tt].push_back(temp);
            if(flag[temp]) vis[temp] = 1;
            else Q.push(temp);
        }
    }
}
int main(){
    int t,i,j,k,x,y,s;
    memset(head,-1,sizeof(head));
    n = read(),m = read(),k = read();
    for(i = 1;i <= k;i++){
        x = read();
        flag[x] = 1;
    }
    for(i = 1;i <= m;i++){
        x = read(),y = read();
        save(x,y),save(y,x);
    }
    for(i = 1;i <= n;i++){
        if(!flag[i]){
            s = i;
            dfs(s);
            break;
        }
    }
    if(cnt != n){
        puts("No");
        return 0;
    }
    puts("Yes");
    for(i = 1;i <= n;i++) vis[i] = 0;
    bfs(s);
    int res = 0;
    for(i = 1;i <= tt;i++){
        if(v[i].size() > 0) ++res;
    }
    printf("%d\n",res);
    for(i = 1;i <= tt;i++){
        if(!v[i].size()) continue;
        printf("%d %d ",id[i],(int)v[i].size());
        for(j = 0;j < (int)v[i].size();j++){
            printf("%d ",v[i][j]);
        }
        puts("");
    }
    return 0;
}