#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;
int n, m, k;
int a[N];
int vis[N];
int coding[N];
vector<int> path[N];
vector<pair<int, vector<int>>> ans;
int rt = 0;

int main() {
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 1; i <= k; ++i) {
        int x;
        scanf("%d", &x);
        coding[x] = 1;
    }
    for (int i = 1; i <= m; ++i) {
        int x, y;
        scanf("%d%d", &x, &y);
        path[x].emplace_back(y);
        path[y].emplace_back(x);
    }
    for (int i = 1; i <= n; ++i) {
        if (!coding[i]) {
            rt = i;
            break;
        }
    }
    if (!rt) {
        puts("No");
        return 0;
    }
    queue<int> q;
    q.push(rt);
    vis[rt] = 1;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        vector<int> res;
        for (auto it : path[u]) {
            if (!vis[it]) {
                vis[it] = 1;
                if (!coding[it]) {
                    q.push(it);
                }
                res.emplace_back(it);
            }
        }
        if (!res.empty()) {
            ans.emplace_back(u, res);
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (!vis[i]) {
            puts("No");
            return 0;
        }
    }
    puts("Yes");
    printf("%d\n", ans.size());
    for (auto it : ans) {
        printf("%d ", it.first);
        printf("%d ", it.second.size());
        for (auto jt : it.second) {
            printf("%d ", jt);
        }
        printf("\n");
    }

    // vsprint
    return 0;
}