#include <bits/stdc++.h>
#define int long long 
#define pb push_back
using namespace std;
const int INF=1e6+5;
int n,m,k,a[INF],vis[INF],vis2[INF];
vector <int> e[INF];
void DFS(int x) {
    if (vis2[x]) return ;
    vis2[x]=1;
    if (vis[x]) return ; 
    for (int v:e[x]) DFS(v);
}
vector < vector <int> > Ans;
void solve() {
    cin>>n>>m>>k;
    for (int w=0;w<=n+3;w++) e[w].clear();
    for (int i=1;i<=k;i++) cin>>a[i],vis[a[i]]=1;
    for (int i=1;i<=m;i++) {
        int x=0,y=0;cin>>x>>y;
        e[x].pb(y);e[y].pb(x);
    }
    if (k==n) cout<<"No\n";
    else {
        int rt=0;
        for (int i=1;i<=n;i++) {
            if (vis[i]) continue;
            DFS(i);rt=i;
            break;
        }
        for (int i=1;i<=n;i++)
            if (!vis2[i]) {cout<<"No\n";return ;}
        memset(vis2,0,sizeof vis2);
        queue <int> q;q.push(rt);vis2[rt]=1;
        while (q.size()) {
            int x=q.front();q.pop();
            if (vis[x]) continue;
            vector <int> d1;d1.pb(x);
            int sum6=0;
            for (int v:e[x]) {
                if (vis2[v]) continue;
                sum6++;
            }
            d1.pb(sum6);
            for (int v:e[x]) {
                if (vis2[v]) continue;
                d1.pb(v);q.push(v);
                vis2[v]=1;
            }
            Ans.pb(d1);
        }
        cout<<"Yes\n";
        cout<<Ans.size()<<"\n";
        int len=Ans.size();
        for (int i=0;i<len;i++) {
            for (int w:Ans[i]) cout<<w<<" ";
            cout<<"\n";
        }
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    int t=1;
    while (t--) solve();
    return 0;
}