#include<bits/stdc++.h>
using namespace std;
const int maxn=5e5+5;
const int maxnn=2e5+5;
int n,m,k,x,y;
bool ava[maxn];
vector <int> edge[maxnn];
struct node {
	int cnt;
	int pass[maxnn];
	int b[maxnn];
	int len;
	int step;
	vector <int> ans[maxnn];
	int lr[maxnn];
}p,t;
queue <node> q;
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m>>k;
	for(int i=1;i<=k;i++) {
		cin>>x;
		ava[x]=1;
	}
	for(int i=1;i<=m;i++) {
		cin>>x>>y;
		if(ava[x] == 0) edge[x].push_back(y);
		if(ava[y] == 0) edge[y].push_back(x);
	}
	for(int i=1;i<=n;i++) {
		if(ava[i] == 0) {
			p.cnt=1;
			p.len=1;
			p.b[i]=1;
			p.pass[1]=i;
			p.step=0;
			q.push(p);
			break;
		}
	}
	bool ok,okk;
	while(!q.empty()) {
		t=q.front();
		q.pop();
		ok=0;
		for(int i=t.cnt;i<=t.len;i++) {
			okk=0;
			for(int j=0;j<edge[t.pass[i]].size();j++) {
				if(t.b[edge[t.pass[i]][j]] == 0) {
					if(okk==0) {
						t.step++;
						okk=1;
						t.lr[t.step]=t.pass[i];
					}
					ok=1;
					t.len++;
					t.pass[t.len] = edge[t.pass[i]][j];
					t.b[edge[t.pass[i]][j]] = 1;
					t.ans[t.step].push_back(edge[t.pass[i]][j]);
				}
			}
		}		
		t.cnt++;
		if(ok==0) {
			cout<<"No"<<endl;
			break;
		}
		if(t.len==n) {
			cout<<"Yes"<<endl;
			cout<<t.step<<endl;
			for(int i=1;i<=t.step;i++) {
				cout<<t.lr[i]<<' '<<t.ans[i].size();
				for(int j=0;j<t.ans[i].size();j++) cout<<' '<<t.ans[i][j];
				cout<<endl;
			}
			break;
		}
		q.push(t);
	}
	return 0;
}