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

void dfs(int pos, vector<vector<int>> &G, vector<vector<int>> &Ans, vector<int> &Order, vector<bool> &Busy, vector<bool> &Visited) {
	Visited[pos] = true;
	Order.push_back(pos);
	if (Busy[pos] == true) return;

	// Recursion
	for (int to : G[pos]) {
		if (Visited[to] == true) continue;
		Ans[pos].push_back(to);
		dfs(to, G, Ans, Order, Busy, Visited);
	}
}

void Solve(int N, int M, int K, vector<int> A, vector<pair<int, int>> E) {
	// Step 1. Make Graph
	vector<vector<int>> G(N + 1, vector<int>(0, 0));
	vector<bool> Busy(N + 1, false);
	for (int i = 0; i < M; i++) G[E[i].first].push_back(E[i].second);
	for (int i = 0; i < M; i++) G[E[i].second].push_back(E[i].first);
	for (int i = 0; i < K; i++) Busy[A[i]] = true;

	// Step 2. DFS
	vector<bool> Visited(N + 1, false);
	vector<int> Order;
	vector<vector<int>> Ans(N + 1, vector<int>(0, 0));
	for (int i = 1; i <= N; i++) {
		if (Busy[i] == true) continue;
		dfs(i, G, Ans, Order, Busy, Visited);
		break;
	}

	// Step 3. Check
	for (int i = 1; i <= N; i++) {
		if (Visited[i] == false) {
			printf("No\n");
			return;
		}
	}

	// Step 4. Output Main
	vector<int> Base;
	vector<vector<int>> Outp;
	for (int idx : Order) {
		if (Ans[idx].size() >= 1) {
			Base.push_back(idx);
			Outp.push_back(Ans[idx]);
		}
	}

	// Step 5. Output Actual
	printf("Yes\n");
	printf("%d\n", (int)Outp.size());
	for (int i = 0; i < (int)Outp.size(); i++) {
		printf("%d %d", Base[i], (int)Outp[i].size());
		for (int j = 0; j < (int)Outp[i].size(); j++) printf(" %d", Outp[i][j]);
		printf("\n");
	}
}

int main() {
	int T = 1;
	for (int t = 1; t <= T; t++) {
		int N, M, K; scanf("%d%d%d", &N, &M, &K);
		vector<int> A(K);
		vector<pair<int, int>> E(M);
		for (int i = 0; i < K; i++) scanf("%d", &A[i]);
		for (int i = 0; i < M; i++) scanf("%d%d", &E[i].first, &E[i].second);
		Solve(N, M, K, A, E);
	}
	return 0;
}