#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> bad(n);
    for (int i = 0, x; i < k; ++i) {
        cin >> x;
        bad[x - 1] = true;
    }
    vector<int> used(n);
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    vector<vector<int>> ans(n);
    int source = 0;
    if (k == n) {
        cout << "No\n";
        return;
    }
    while (bad[source]) {
        source += 1;
    }
    queue<int> q;
    q.push(source);
    used[source] = true;
    vector<int> ord;
    while (!q.empty()) {
        int x = q.front();
        ord.push_back(x);
        q.pop();
        for (int to : adj[x]) {
            if (!bad[to] && !used[to]) {
                used[to] = true;
                q.push(to);
                ans[x].push_back(to);
            }
        }
    }
    if (ord.size() < n - k) {
        cout << "No\n";
        return;
    }
    for (int i = 0; i < n; ++i) {
        if (bad[i]) {
            bool any = false;
            for (int to : adj[i]) {
                if (used[to]) {
                    any = true;
                    ans[to].push_back(i);
                    break;
                }
            }
            if (!any) {
                cout << "No\n";
                return;
            }
        }
    }
    vector<vector<int>> op;
    for (int x : ord) {
        if (ans[x].size() > 0) {
            op.push_back({});
            op.back().push_back(x);
            op.back().push_back(int(ans[x].size()) - 1);
            op.back().insert(op.back().end(), ans[x].begin(), ans[x].end());
        }
    }
    cout << "Yes\n";
    cout << op.size() << '\n';
    for (auto x : op) {
        for (auto y : x) {
            cout << y + 1 << " ";
        }
        cout << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int test = 1;
//    cin >> test;

    while (test--) {
        solve();
    }

    return 0;
}