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

#define ll long long 
#define pii pair<ll,ll>
#define endl '\n'
#define vv vector
#define all(x) x.begin()+1,x.end()

#define int ll

#define ft first
#define sd second


void solve(){

    int n,m,k;cin>>n>>m>>k;

    queue<int>q;

    map<int,int>mp;
    for(int i=1;i<=k;i++){
        int a;cin>>a;
        mp[a]++;
    }

    vv<vv<int>>e(n+1);

    for(int i=1;i<=m;i++){
        int a,b;cin>>a>>b;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    vv<pair<int,vv<int>>>rs;
    for(int i=1;i<=n;i++){
        if(mp.find(i)==mp.end()){ 
            q.push(i);
            break;
        }
    }

    vv<int>flag(n+1);
    while(q.size()){
        int nd=q.front();
        q.pop();
        flag[nd]=1;
        vv<int>now;
        for(auto a:e[nd]){
            if(flag[a])
                continue;
            now.push_back(a);
            flag[a]=1;
            if(mp.find(a)==mp.end())
                q.push(a);
        }
        rs.push_back({nd,now});
    }


    for(int i=1;i<=n;i++)
        if(!flag[i]){
            cout<<"No"<<endl;
            return ;
        }

    cout<<"Yes"<<endl;
    cout<<rs.size()<<endl;
    for(int i=0;i<rs.size();i++){

        cout<<rs[i].first<<' '<<rs[i].second.size()<<' ';
        for(auto a:rs[i].second)
            cout<<a<<' ';
        cout<<endl;

    }



}
signed main(){

    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    int _=1;
    //cin>>_;
    while(_--)
        solve();


    return 0;
}