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

#define ll long long

const int maxn=2e5+10;
int flag[maxn],busy[maxn];
queue<int> q;
vector<int> v[maxn];
vector<int> ans[maxn];
vector<int> u;

void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    memset(flag,0,sizeof(flag));
    memset(busy,0,sizeof(busy));
    for(int i=1;i<=k;i++){
        int num;
        cin>>num;
        busy[num]=1;
    }
    for(int i=1;i<=m;i++){
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int fa=0;
    if(n==k){
        cout<<"No"<<'\n';
        return;
    }
    for(int i=1;i<=n;i++){
        if(!busy[i]){
            fa=i;
            break;
        }
    }
    
    q.push(fa);
    flag[fa]=1;
    int cnt=1;
    int now=0;
    while(!q.empty()){
        int num=q.front();
        q.pop();
        u.push_back(num);
        for(auto x:v[num]){
            if(!flag[x]){
                cnt++;
                flag[x]=1;
                ans[now].push_back(x);
                if(!busy[x]){
                    q.push(x);
                }
            }
        }
        if(ans[now].size()==0) now--;
        now++;
    }
    if(cnt==n){
        cout<<"Yes"<<'\n';
        cout<<now<<'\n';
        for(int i=0;i<now;i++){
            cout<<u[i]<<" "<<ans[i].size()<<" ";
            for(auto x:ans[i]){
                cout<<x<<" ";
            }
            cout<<'\n';
        }
    }
    else{
        cout<<"No"<<'\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;
    t=1;
    while(t--){
        solve();
    }
}