#include <bits/stdc++.h>

using i64 = long long;
using l64 = long double;

struct DSU {
    std::vector<int> fa, siz;

    DSU() {}

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        fa.resize(n);
        std::iota(fa.begin(), fa.end(), 0);
        siz.assign(n, 1);
    }

    int find(int x) {
        while (x != fa[x]) {
            x = fa[x] = fa[fa[x]];
        }
        return x;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        fa[y] = x;
        return true;
    }

    int size(int x) {
        return siz[find(x)];
    }
};

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;
    std::set<int> se;
    for (int i = 1; i <= k; i++) {
        int x;
        std::cin >> x;
        se.insert(x);
    }
    DSU dsu(n + 1);
    std::vector<std::vector<int>> adj(n + 1);
    for (int i = 1; i <= m; i++) {
        int u, v;
        std::cin >> u >> v;
        if (se.count(u) && se.count(v)) {
            continue;
        }
        if (se.count(u)) {
            adj[v].push_back(u);
        } else if (se.count(v)) {
            adj[u].push_back(v);
        } else {
            dsu.merge(u, v);
            adj[v].push_back(u);
            adj[u].push_back(v);
        }
    }

    std::set<int> t1;
    for (int i = 1; i <= n; i++) {
        t1.insert(dsu.find(i));
    }

    std::vector<int> vis(n + 1);
    std::queue<int> q;
    std::vector<std::vector<int>> ans;
    for (int x: t1) {
        if (se.count(x)) continue;
        vis[x] = 1;
        q.emplace(x);
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            std::vector<int> doc = {u};
            for (int v: adj[u]) {
                if (!vis[v]) {
                    doc.push_back(v);
                    q.push(v);
                    vis[v] = 1;
                }
            }
            if (doc.size() == 1) continue;
            ans.push_back(doc);
        }
        break;
    }
    if (std::accumulate(vis.begin(), vis.end(), 0) != n) {
        std::cout << "No\n";
        return;
    }
    std::cout << "Yes\n";
    std::cout << ans.size() << "\n";
    for (auto &it: ans) {
        std::cout << it[0] << " " << it.size() - 1 << " ";
        for (int i = 1; i < it.size(); i++) {
            std::cout << it[i] << " \n"[i == it.size() - 1];
        }
    }

}

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