#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f
#define PII pair<int, int>
const int N = 2e6 + 10;
int n, m, k, pr[N], a[N];
int find(int x) {
	if (pr[x] == x)return x;
	return pr[x] = find(pr[x]);
}
void join(int x, int y) {
	int fx = find(x), fy = find(y);
	if (fx != fy) {
		pr[fx] = fy;
	}
}
vector<int>g[N], ans[N];
int vis[N], idd[N], st[N], tot;
void dfs(int now) {
	vis[now] = 1;
	if (st[now])return ;
	idd[++tot] = now;
	for (auto i : g[now]) {
		if (vis[i])continue;
		dfs(i);
		ans[now].push_back(i);
	}
}
void solve() {
	cin >> n >> m >> k;
	map<int, int>mp;
	for (int i = 1; i <= n; i++)pr[i] = i;
	for (int i = 1; i <= k; i++) {
		cin >> a[i];
		st[a[i]] = 1;
	}
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	int fa = 0;
	for (int i = 1; i <= n; i++) {
		if (!st[i]) {
			fa = i;
			break;
		}
	}
	dfs(fa);
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			cout << "No" << endl;
			return ;
		}
	}
	int num = 0;
	for (int i = 1; i <= tot; i++) {
		int tmp = idd[i];
		if (!ans[tmp].size())num++;
	}
	cout << "Yes" << endl << tot - num << endl;
	for (int i = 1; i <= tot; i++) {
		int tmp = idd[i];
		if (!ans[tmp].size())continue;
		cout << tmp << " " << ans[tmp].size() << " ";
		for (int j = 0; j < ans[tmp].size(); j++) {
			cout << ans[i][j] << " ";
		}
		cout << endl;
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int _ = 1;
//	cin >> _;
	while (_--) {
		solve();
	}
	return 0;
}