#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}
const int MAXN=200100;
const int MAXM=500010;
struct edge{
	int next,to;
}e[MAXM*2];
int head[MAXN],cnt;
void addedge(int u,int v){
	e[++cnt].next=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
int busy[MAXN];
int vis[MAXN],ind[MAXN];
vector <int> ans[MAXN];
int main()
{
	int n=read(),m=read(),k=read();
	for (int i=1;i<=k;i++)
	{
		int x=read();
		busy[x]=1;
	}	
	for (int i=1;i<=m;i++)
	{
		int u=read(),v=read();
		if (!busy[u]) addedge(u,v);
		if (!busy[v]) addedge(v,u);
	}
	int x=0;
	for (int i=1;i<=n && !x;i++)
		if (!busy[i]) x=i;
	if (!x)
	{
		cout<<"No\n";
		return 0;
	}
	memset(vis,0,sizeof(vis));
	queue <int> q;
	q.push(x);
	vis[x]=1;
	vector <int> bfsq;
	while (!q.empty())
	{
		int u=q.front();
		q.pop();
		bfsq.push_back(u);
		for (int i=head[u];i;i=e[i].next)
		{
			int v=e[i].to;
			if (vis[v]) continue;
			ans[u].push_back(v);
			vis[v]=1;
			q.push(v);
		}
	}
	bool flag=true;
	for (int i=1;i<=n;i++) flag&=vis[i];
	if (!flag)
	{
		cout<<"No\n";
		return 0;
	}
	cout<<"Yes\n";
	vector <int> need_print;
	for (auto i:bfsq) if (ans[i].size()) need_print.push_back(i);
	cout<<need_print.size()<<'\n';
	for (auto id:need_print)
	{
		cout<<id<<' '<<ans[id].size()<<' ';
		for (auto v:ans[id]) cout<<v<<' ';
		cout<<'\n';
	}
	return 0;
}