#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr<<#x<<(x)<<"\n"
#define db1(x) cerr<<#x<<(x)<<" "
#define rep(i,a,b) for(auto i = (a);i<=b;i++)
#define ll long long
const int N = 2e5+10;
int n,m,k;
int a[N];
using pii = pair<int,int>;
vector<pii> e;
int fa[N],vis[N],ok[N];
vector<int> ans[N];
int find(int x){
	return x==fa[x]?x:fa[x] =find(fa[x]);
}
int main()
{
    cin>>n>>m>>k;
    rep(i,1,n)fa[i] =i;
    for(int i=1;i<=k;i++){
        int x;cin>>x;vis[x] =1;
    }
    for(int i=1;i<=m;i++){
        int x,y;cin>>x>>y;
        e.push_back({x,y});
    }
    for(auto [x,y]:e){
        if(vis[x]&&vis[y])continue;
        if(vis[x])swap(x,y);
        if(ok[y])continue;
        ans[x].push_back(y);
        ok[x]=  ok[y] =1;
        if(find(x)==find(y))continue;
        fa[find(y)] = find(x);
    }
    int num =0;
    for(int i=1;i<=n;i++){
    	fa[i]= find(i);
        if(fa[i]==i)++num;
    }
    // for(int i=1;i<=n;i++){
    	// db(fa[i]);
    // }
//    cout<<num<<"\n";
    if(num==1){
        cout<<"Yes\n";
        int num1 =0;
        for(int i=1;i<=n;i++){
            if(ans[i].size())++num1;
        }
        cout<<num1<<"\n";
        for(int i=1;i<=n;i++){
            if(ans[i].size()){
                cout<<i<<" "<<ans[i].size()<<" ";
                for(auto x:ans[i]){
                    cout<<x<<" ";
                }
                cout<<"\n";
            }
        }
    }else {
        cout<<"No\n";
    }
    
}