#include<bits/stdc++.h>
#define rep(a,b,c) for(int c(a);c<=(b);++c)
#define drep(a,b,c) for(int c(a);c>=(b);--c)
using namespace std;
inline int read()
{
	int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
	while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
const int N=1e6+10;
int n,m,fa[N];
bool vis[N],a[N];
int que[N],H,TT,t;
vector<int> G[N],T[N],Q[N];
inline void dfs(int u)
{
	if(!Q[u].size())return;
	printf("%d %d ",u,int(Q[u].size()));
	for(int v:Q[u])printf("%d ",v);puts("");
	for(int v:Q[u])dfs(v);
}
inline void Solve()
{
	n=read();m=read();int aa=read();
	while(aa--)a[read()]=true;
	rep(1,m,i)
	{
		int u=read(),v=read();
		if(a[u])swap(u,v);
		if(a[u])
		{
			;
		}
		else if(a[v])
		{
			G[v].push_back(u);
		}
		else
		{
			T[u].push_back(v);
			T[v].push_back(u);
		}
	}
	int rt=0;
	rep(1,n,i)if(!a[i]){rt=i;break;}
	if(!rt)
	{
		puts("No");
		return;
	}
	que[H=TT=0]=rt;vis[rt]=true;
	while(H<=TT)
	{
		int u=que[H++];
		for(int v:T[u])if(!vis[v])
		{
			que[++TT]=v;
			vis[v]=true;
			fa[v]=u;
		}
	}
	 
	rep(1,n,u)if(!a[u]&&!vis[u])
	{
		puts("No");return;
	}
	rep(1,n,u)if(a[u])
	{
		if(!G[u].size())
		{
			puts("No");return;
		}
		fa[u]=(*(G[u].begin()));
	}
//	rep(1,n,i)printf("%d ",fa[i]);puts("");
//	return;
	rep(1,n,i)if(fa[i])Q[fa[i]].push_back(i);
	rep(1,n,i)if(Q[i].size())++t;
	puts("Yes");
	printf("%d\n",t);dfs(rt);
}
int main()
{
	int T=1;
	while(T--)Solve();
	return 0;
}
/*
 4 5 2
 3 4
 1 2
 1 3
 2 3
 3 4
 2 4
*/