#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mem(a,x,n) memset(a,x,sizeof(*a)*((n)+2))
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int N = 2e5+5;
int n,m,q;
bool del[N],vis[N];
Vi e[N];
vector<pair<int,Vi>> ans;

void dfs(int u) {
	if( del[u] ) return;
	ans.pb(u,Vi());
	for(int v : e[u]) if( !vis[v] ) vis[v] = 1, ans.back().se.pb(v);
	for(int v : ans.back().se) dfs(v);
}

void MAIN() {
	cin>>n>>m>>q; For(i,1,q) del[read()] = 1;
	For(i,1,m, x,y) cin>>x>>y, e[x].pb(y), e[y].pb(x);
	For(i,1,n) if( !del[i] ) { vis[i] = 1, dfs(i); break; }
	For(i,1,n) if( !vis[i] ) { cout<<"No\n"; return; }
	cout<<"Yes\n"<<sz(ans)<<'\n';
	for(auto [i,j] : ans) {
		cout<<i<<" "<<sz(j)<<" ";
		for(int k : j) cout<<k<<" ";
		cout<<'\n';
	}
} signed main() {
#ifdef FS
	freopen("in","r",stdin); freopen("out","w",stdout);
#endif
	ios::sync_with_stdio(0);cin.tie(0);
	int lft=1; while( lft-- ) {
		MAIN();
	}
	return 0;
}