#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define lowbit(x) (x)&(-x)
//#define int long long
//#define double long double 
const int N = 2e5 + 5;
const ll base = 131;
const ll mod = 998244353;
void solve() {
    int n,m,k;
    cin>>n>>m>>k;
    vector<int>a(n+1);
    for(int i=1;i<=k;++i){
        int x;
        cin>>x;
        a[x]=1;
    }
    vector<vector<int>>w(n+1);
    while(m--){
        int u,v;
        cin>>u>>v;
        w[u].push_back(v);
        w[v].push_back(u);
    }
    vector<int>vis(n+1),Vis(n+1);
    queue<int>q;
    for(int i=1;i<=n;++i){
        if(!a[i]){
            q.push(i);
            Vis[i]=1;
            //cerr<<i<<'\n';
            break;
        }
    }
    vector<vector<int>>as(n+1);
    while(!q.empty()){
        int now=q.front();
        q.pop();
        if(vis[now]) continue;
        vis[now]=1;
        for(int i=0;i<w[now].size();++i){
            int res=w[now][i];
            if(vis[res]) continue;
            if(!Vis[res]) as[now].push_back(res),Vis[res]=1;
            if(!vis[res]&&!a[res]) q.push(res); 
        }
    }
    for(int i=1;i<=n;++i){
        if(!Vis[i]){
            //cerr<<i<<'\n';
            cout<<"No\n";
            return ;
        }
    }
    cout<<"Yes\n";
    int cnt=0;
    for(int i=1;i<=n;++i){
        if(!as[i].empty()) cnt++;
    }
    cout<<cnt<<'\n';
    for(int i=1;i<=n;++i){
        if(as[i].empty()) continue;
        cout<<i<<" "<<as[i].size()<<" ";
        for(int j=0;j<as[i].size();++j) cout<<as[i][j]<<" ";
        cout<<'\n';
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) solve();
}