#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define max(A,B) (A>B? A:B)
#define min(A,B) (A<B? A:B)
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define pir(X) pair<X,X>
#define mpr(A,B) make_pair(A,B)
#define fr first
#define sc second
#define sq(x) ((x)*(x))
using namespace std;

const int N=5e5+10;
int n,del[N],m,k;
vector<int> t[N],tt[N];

struct edge{
    int x,y;
}e[N];

struct uf_s{
    int fa[N],siz[N];
    void init(){
        for(int i=1;i<=n;i++) fa[i]=i,siz[i]=1;
    }
    int find(int x){
        if(x==fa[x]) return fa[x];
        fa[x]=find(fa[x]);
        return fa[x];
    }
    bool mrg(int x,int y){
        x=find(x),y=find(y);
        if(x==y) return 0;
        if(siz[x]<siz[y]) swap(x,y);
        fa[y]=x,siz[x]+=siz[y];
        return 1;
    }
}s;

void fst_IO(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int count(int u,int fa){
    if(tt[u].size()-(fa!=u? 1:0)==0) return 0;
    int tot=1;
    for(int v:tt[u]) if(v!=fa) tot+=count(v,u);
    return tot;
}


void print(int u,int fa){
    int siz=tt[u].size()-(fa!=u? 1:0);
    if(!siz) return;
    cout<<u<<" "<<siz<<' ';
    for(int v:tt[u]) if(v!=fa) cout<<v<<' ';
    cout<<'\n';
    for(int v:tt[u]) if(v!=fa) print(v,u);
    return;
}


int main(){
    fst_IO();
    cin>>n>>m>>k;
    set<int> st;
    s.init();
    for(int i=1;i<=k;i++) cin>>del[i],st.insert(del[i]);
    for(int i=1;i<=m;i++){
        cin>>e[i].x>>e[i].y;
        t[e[i].x].push_back(e[i].y);
        t[e[i].y].push_back(e[i].x);
    }
    if(n==k){
        cout<<"No\n";
        return 0;
    }
    int cnt=1;
    for(int i=1;i<=m;i++){
        if(st.count(e[i].x)||st.count(e[i].y)) continue;
        if(s.mrg(e[i].x,e[i].y)){
            tt[e[i].x].push_back(e[i].y);
            tt[e[i].y].push_back(e[i].x);
            cnt++;
        }
    }
    // cerr<<"cnt="<<cnt<<'\n';
    if(cnt+k==n){
        for(int i=1;i<=k;i++){
            bool flg=0;
            for(int v:t[del[i]]){
                if(st.count(v)) continue;
                else{
                    tt[del[i]].push_back(v);
                    tt[v].push_back(del[i]);
                    flg=1;
                    break;
                }
            }
            if(!flg){
                cout<<"No\n";
                return 0;
            }
        }

        cout<<"Yes\n";
        int root=1;
        while(st.count(root)) root++;
        cout<<count(root,root)<<'\n';
        print(root,root);
    }
    else{
        cout<<"No\n";
    }
    return 0;
}