#include <bits/stdc++.h>

using namespace std;

vector<int> ans;
int n, m, k;
void dfs(int now, vector<vector<int>> f, vector<int> nofree, vector<int>& inn, int& person, vector<vector<int>>& st) {
    if (person == n) {
        return;
    }
    for (auto x : f[now]) {
        if (inn[x] == 0) {
            inn[x] = 1;
            person++;
            st[now].push_back(x);
            if (person == n) {
                break;
            }
            if (nofree[x] == 0 && f[x].size() > 1) {
                dfs(x, f, nofree, inn, person, st);
            }
        }
        if (person == n) {
            break;
        }
    }
    if (st[now].size() != 0) {
        ans.push_back(now);
    }
}

void solve() {
    cin >> n >> m >> k;
    vector<int> nofree(n + 1);
    for (int i = 0; i < k; i++) {
        int x;
        cin >> x;
        nofree[x] = 1;
    }
    vector<vector<int>> f(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        if (nofree[x] == 0) {
            f[x].push_back(y);
        }
        if (nofree[y] == 0) {
            f[y].push_back(x);
        }
    }
    vector<vector<int>> st(n + 1);
    vector<int> inn(n + 1);
    int person = 1;
    for (int i = 1; i <= n; i++) {
        if (nofree[i] == 0) {
            inn[i] = 1;
            dfs(i, f, nofree, inn, person, st);
            break;
        }
    }
    if (person != n) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    cout << ans.size() << "\n";
    for (int i = ans.size() - 1; i >= 0; i--) {
        cout << ans[i] << " " << st[ans[i]].size();
        for (auto x : st[ans[i]]) {
            cout << " " << x;
        }
        cout << "\n";
    }
}

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