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

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

const int maxn = 2e5 + 5;
vector <int> g[maxn];
int ok[maxn],vis[maxn];

void dfs(int u,int f) {
	ok[u] = 1;
	if (vis[u]) return ;
	for (auto i : g[u]) {
		if (i == f) continue;
		if (ok[i]) continue;
		dfs(i,u);
	}
}

vector <vector <int>> ans;

void find_path(int u,int f) {
	ok[u] = 1;
	if (vis[u]) return ;
	vector <int> res;
	vector <int> val;
	for (auto i : g[u]) {
		if (i == f) continue;
		if (ok[i]) continue;
		val.push_back(i);
		find_path(i,u);
	}
	if (!val.empty()) {
		res.push_back(u);
		res.push_back((int)val.size());
		for (auto i : val) res.push_back(i);
		ans.push_back(res);	
	}
}

void GENSHEN_START() {
	int n,m,k;cin >> n >> m >> k;
	for (int i = 1;i <= k;i++) {
		int x;cin >> x;
		vis[x] = 1;
	}
	if (k == 0) getchar();
	for (int i = 1;i <= m;i++) {
		int u,v;cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	int p;
	for (int i = 1;i <= m;i++) {
		if (!vis[i]) {
			p = i;
			dfs(i,0);
			break;
		}
	}
	for (int i = 1;i <= n;i++) {
		if (ok[i] == 0) {
			cout << "No" << '\n';
			return ;
 		}
	}
	cout << "Yes" << '\n';
	for (int i = 1;i <= n;i++) ok[i] = 0;
	find_path(p,0);
	int len = ans.size();
	cout << len << '\n';
	for (int i = len - 1;i >= 0;i--) {
		for (auto j : ans[i]) {
			cout << j << ' ';
		}
		cout << '\n';
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	//cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}