#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int N = 200010;
const int M = 1000010;
int n, m, k;
bool a[N];
bool is_find[N];
int e[M], ne[M], h[N], idx;
int root = 1;
int number = 0;
vector<int> q[N];
int hh = 1, ans = 0;
void add(int a, int b)
{
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
void dfs(int u,int father)
{
	is_find[u] = true;
	number++;
	if (a[u])return;
	for (int i = h[u]; i != -1; i = ne[i])
	{
		int j = e[i];
		if (j == father)continue;
		if (is_find[j])continue;
		q[u].push_back(j);
		dfs(j, u);
	}
}
void dfs2(int u, int father)
{
	is_find[u] = true;
	if (a[u])return;
	if (q[u].size())
	{
		cout << u << " ";
		cout << q[u].size() << " ";
		for (int i = 0; i < q[u].size(); i++)
			cout << q[u][i] << " ";
		cout << endl;
		for (int i = h[u]; i != -1; i = ne[i])
		{
			int j = e[i];
			if (j == father)continue;
			if (is_find[j])continue;
			dfs2(j, u);
		}
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	cin >> n >> m >> k;
	for (int i = 1; i <= k; i++)
	{
		int x;
		cin >> x;
		a[x] = true;
	}
	memset(h, -1, sizeof h);
	for (int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		add(u, v);
		add(v, u);
	}
	while (a[root])root++;
	if (root > n)
	{
		cout << "No" << endl;
		return 0;
	}
	dfs(root, 0);
	if (number < n)
	{
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;

	for (int i = 1; i <= n; i++)
	{
		if (q[i].size())ans++;
	}
	cout << ans << endl;
	memset(is_find, 0, sizeof is_find);
	dfs2(root, 0);
	return 0;
}
/*
4 5 2
3 4 
1 2 
1 3 
2 3 
3 4 
2 4


4 5 3
2 4 3
1 2
1 3
2 3
3 4
2 4*/