#include <bits/stdc++.h>
#define endl '\n'

using ll = long long;

constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

using namespace std;

void solve(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> f(n + 1), busy(n + 1);
	iota(f.begin(), f.end(), 0);
	auto find = [&](auto self, int x) -> int {
		if (x == f[x]) return x;
		return f[x] = self(self, f[x]);
	};
	for (int i = 1; i <= k; ++i) {
		int x;
		cin >> x;
		busy[x] = 1;
	}
	for (int i = 1; i <= n; ++i) f[i] = i;

	vector<vector<int>> E(n + 1), G(n + 1);

	vector<int> fa(n + 1);
	
	for (int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		if (busy[u] && busy[v]) continue;
		if (busy[u]) {
			if (fa[u]) continue;
			fa[u] = 1;
			E[v].push_back(u);
		}else if (busy[v]) {
			if (fa[v]) continue;
			fa[v] = 1;
			E[u].push_back(v);
		}else {
			int fu = find(find, u), fv = find(find, v);
			if (fu != fv) {
				f[fu] = fv;
			}
			G[u].push_back(v);
			G[v].push_back(u);
		}
	}

	int cnt = 0, rt;
	for (int i = 1; i <= n; ++i) {
		if (busy[i]) {
			if (!fa[i]) {
				cout << "No" << endl;
				return;
			}
		}else {
			if (find(find, i) != i) continue;
			++cnt;
			rt = i;
		}
	}
	if (cnt != 1) {
		cout << "No" << endl;
		return;
	}
	vector<vector<int>> res;
	queue<int> q;
	vector<int> vis(n + 1);
	q.push(rt);
	vis[rt] = 1;
	while (!q.empty()) {
		auto x = q.front();
		q.pop();
		vector<int> cur;
		for (auto y : E[x]) {
			cur.push_back(y);
		}
		for (auto y : G[x]) {
			if (vis[y]) continue;
			vis[y] = 1;
			q.push(y);
			cur.push_back(y);
		}
		if (cur.empty()) continue;
		cur.push_back(cur.size());
		cur.push_back(x);
		reverse(cur.begin(), cur.end());
		res.push_back(cur);
	}
	cout << "Yes" << endl;
	cout << (int)res.size() << endl;
	for (auto v : res) {
		for (auto x : v) {
			cout << x << " ";
		}
		cout << endl;
	}
}

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

/*
4 5 3
2 4 3
1 2
1 3
2 3
3 4
2 4
*/