#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define int long long
#define x first
#define y second
void miss() {
	int n,m,k;
	cin >> n >> m >> k;
	vector<vector<int>>mp(n + 1);
	vector<bool>ai(n + 1);
	for(int i = 1; i <= k; i++) {
		int a;
		cin >> a;
		ai[a] = 1;
	}
	for(int i = 1; i <= m; i++) {
		int a,b;
		cin >> a >> b;
		mp[a].push_back(b);
		mp[b].push_back(a);
	}
	int sum;
	for(int i = 1; i <= n; i++) {
		if(!ai[i]) {
			sum = i;
			break;
		}
	}
	queue<int>q;
	q.push(sum);
	vector<bool>fg(n + 1);
	vector<vector<int>>ans(n + 1);
	fg[sum] = 1;
	int zlm = 1;
	while(q.size()) {
		int x = q.front();
		q.pop();
		for(auto v : mp[x]) {
			if(!fg[v]) {
				zlm++;
				fg[v] = 1;
				ans[x].push_back(v);
				if(!ai[v]) q.push(v);
			}
		}
	}
	if(zlm != n) cout << "No\n";
	else {
		int qqq = 0;
		for(int i = 1; i <= n; i++) {
			if(ans[i].size()) qqq++;
		}		
		cout << "Yes\n";
		cout << qqq << endl;
		q.push(sum);
		while(q.size()) {
			cout << q.front() << " ";
			cout << ans[q.front()].size() << " ";
			for(auto v : ans[q.front()]) {
				cout << v << " ";
				if(!ai[v]) q.push(v);
			}
			cout << endl;
			q.pop();
		}
	} 
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T = 1;
	//cin >> T;
	while(T--) miss();
	//system("pause");
}