#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];
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];
		mp[a[i]] = 1;
	}
	set<int>ans;
	int fa = 0;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;

		if (find(u) != find(v)) {
			if (mp[u] == 0) {
				if (ans.size() == 0) {
					join(v, u);
					ans.insert(u);
					g[u].push_back(v);
					fa = u;
				} else {
					if (find(u) == fa) {
						join(v, u);
						ans.insert(u);
						g[u].push_back(v);
						fa = u;
					}
				}
			} else if (mp[v] == 0) {
				if (ans.size() == 0) {
					join(u, v);
					ans.insert(v);
					g[v].push_back(u);
					fa = v;
				} else {
					if (find(v) == fa) {
						join(u, v);
						ans.insert(v);
						g[v].push_back(u);
						fa = v;
					}
				}
			}
		}
	}
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		if (pr[i] == i)cnt++;
	}
	if (cnt != 1)cout << "No" << endl;
	else {
		cout << "Yes" << endl;
		cout << ans.size() << endl;
		for (auto t : ans) {
			cout << t << " ";
			cout << g[t].size() << " ";
			for (int j = 0; j < g[t].size(); j++) {
				cout << g[t][j] << " ";
			}
			cout << endl;
		}
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int _ = 1;
//	cin >> _;
	while (_--) {
		solve();
	}
	return 0;
}