#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll ok[200009],vis[200009],qq[200009];
vector<ll> es[200009],ans[200009];
void solve(){
    ll n,m,k;
    cin>>n>>m>>k;
    ll miok=1;
    for(ll i=1;i<=k;i++){
        ll u;
        cin>>u;
        ok[u]=1;
    }
    while(ok[miok]) miok++;
    for(ll i=1;i<=m;i++){
        ll u,v;
        cin>>u>>v;
        if(!ok[u]) es[u].push_back(v);
        if(!ok[v]) es[v].push_back(u);
    }
    if(miok>n) {cout<<"No\n";return;}
    queue<ll> q;
    ll id=1;
    vis[miok]=1;
    q.push(miok);
    while(!q.empty()){
        
        ll u=q.front();
      //  cout<<u<<'\n';
        qq[id]=u;
        q.pop();
        for(ll i:es[u]){
            if(!vis[i]) {
                ans[id].push_back(i);
                vis[i]=1;
                q.push(i);
            }
        }
        id++;
    }
    if(id<=n){
        cout<<"No\n";
        return;
    }
    cout<<"Yes\n";
    ll rtn=0;
    for(ll i=1;i<=n;i++){
    //    cout<<qq[i]<<" ";
        if(ans[i].size()>0) rtn++;
    }
  //  cout<<'\n';
    cout<<rtn<<'\n';
    for(ll i=1;i<=n;i++){
        //cout<<qq[i]<<'\n';
        if(ans[i].size()==0) continue;
        cout<<qq[i]<<" "<<ans[i].size();
        for(ll j:ans[i]) cout<<" "<<j;
        cout<<'\n';
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    // cin>>n;
    while(n--)solve();
    return 0;
}