#include <bits/stdc++.h>
using namespace std;
#define ll long long

void solve() {

	int n, m, k;
	cin >> n >> m >> k;

	vector<int> vis(n + 1), vis1(n + 1);
	for (int i = 0 ; i < k ; i++) {
		int x;
		cin >> x;
		vis[x] = 1;
	}

	vector<vector<int>> e(n + 1), ret(n + 1);
	vector<int> op;
	for (int i = 0 ; i < m ; i++) {
		int u, v;
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}

	queue<int> q;
	for (int i = 1 ; i <= n ; i++)
		if (!vis[i]) {
			q.push(i);
			vis1[i] = 1;
			break;
		}

	if (q.empty()) {
		cout << "No\n";
		return;
	}

	while (q.size()) {
		auto u = q.front();
		q.pop();

		for (auto v : e[u]) {
			if (!vis1[v]) {
				ret[u].push_back(v);
				vis1[v] = 1;
				if (!vis[v])
					q.push(v);
			}
		}

		if (ret[u].size())
			op.push_back(u);
	}

	for (int i = 1; i <= n ; i++)
		if (!vis1[i]) {
			cout << "No\n";
			return;
		}

	cout << "Yes\n" << op.size() << '\n';
	for (auto v : op) {
		cout << v << ' ';
		cout << ret[v].size() << ' ';
		for (auto x : ret[v])
			cout << x << ' ';
		cout << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}