#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int pr[N];
int find(int x)
{
	return pr[x]==x?x:pr[x]=find(pr[x]);
}
int main()
{
	int n,m,k;
	cin>>n>>m>>k;
	vector<bool>a(n+1),fa(n+1);
	for(int i=1;i<=k;i++)
	{
		int x;
		cin>>x;
		a[x]=true;
	}
	vector<int>deg(n+1);
	vector<vector<int>>e(n+1),g(n+1);
	for(int i=1;i<=n;i++)
		pr[i]=i;
	for(int i=0;i<m;i++)
	{
		int p,q;
		cin>>p>>q;
		if(a[p]&&a[q])continue;
		if(a[p])
		{
			if(fa[p])continue;
			fa[p]=true;
			e[q].push_back(p);
		}
		else if(a[q])
		{
			if(fa[q])continue;
			fa[q]=true;
			e[p].push_back(q);
		}
		else
		{
			if(find(p)!=find(q))pr[find(q)]=find(p);
			g[p].push_back(q);
			g[q].push_back(p);
		}
	}
	bool ok=true;
	int cnt=0,rt;
	for(int i=1;i<=n;i++)
		if(a[i])
		{
			if(!fa[i])ok=false;
		}
		else
		{
			if(find(i)!=i)continue;
			++cnt;
			rt=i;
		}
	if(!ok||cnt!=1)
	{
		cout<<"No"<<endl;
		return 0;
	}
	vector<vector<int>>res;
	queue<int>q;
	vector<bool>vis(n+1);
	q.push(rt);
	vis[rt]=true;
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		vector<int>cur;
		for(auto &y:e[x])
			cur.push_back(y);
		for(auto &y:g[x])
		{
			if(vis[y])continue;
			cur.push_back(y);
			q.push(y);
			vis[y]=true;
		}
		if(cur.empty())continue;
		cur.push_back(cur.size());
		cur.push_back(x);
		reverse(cur.begin(),cur.end());
		res.push_back(cur);
	}
	cout<<"Yes"<<endl;
	cout<<res.size()<<endl;
	for(auto &v:res)
	{
		for(auto &x:v)
			cout<<x<<" ";
		cout<<endl;
	}
	return 0;
}