#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;

const int N = 2e5 + 2;
typedef pair<int, int> pii;

int n, m, k;
bool ban[N], bio[N];
vector<int> adj[N];
vector<pair<int, vector<int>>> ans;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin >> n >> m >> k;
	
	for (int i = 0; i < k; ++i) {
		int x; cin >> x, --x;
		ban[x] = 1;
	}
	
	for (int i = 0; i < m; ++i) {
		int u, v;
		cin >> u >> v, --u, --v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	
	bool ok = 1;
	for (int i = 0; i < n; ++i) {
		bool found = 0;
		if (ban[i]) {
			for (int x : adj[i]) found |= !ban[x];
			ok &= found;
		}
	}
	
	queue<int> bfs;
	int root = 0;
	while (ban[root]) ++root;
	
	if (root == n) root = 0;

	bfs.push(root);
	bio[root] = 1;
	
	while (!bfs.empty()) {
		int node = bfs.front(); bfs.pop();
		
		if (ban[node]) continue;
		
		pair<int, vector<int>> cur = {node, {}};
		for (int x : adj[node]) {
			if (!bio[x]) {
				bfs.push(x);
				cur.Y.push_back(x);
				bio[x] = 1;
			}
		}
		
		if (!cur.Y.empty()) ans.push_back(cur);
	}
	
	for (int i = 0; i < n; ++i) {
		ok &= bio[i];
	}
	
	if (!ok) {
		cout << "No\n";
	} else {
		cout << "Yes\n" << ans.size() << "\n";
		for (auto x : ans) {
			cout << x.X + 1 << " " << x.Y.size();
			for (int node : x.Y) cout << " " << node + 1;
			cout << "\n";
		}
	}
	
	return 0;
}