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

const int N = 2e5 + 10;
bool vis1[N], vis2[N];

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

    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < k; i++) {
        int x; cin >> x;
        vis1[x] = 1;
    }
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        if (vis1[x] && !vis1[y]) {
            adj[y].push_back(x);
        } 
        if (!vis1[x] && vis1[y]) {
            adj[x].push_back(y);
        }
        if (!vis1[x] && !vis1[y]) {
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
    }

    queue<int> q;
    q.push(1);
    int cnt = 0;
    vector<vector<int>> ans(n + 1);
    while (q.size()) {
        int u = q.front();
        vis2[u] = 1;
        q.pop();
        cnt++;
        // cout << u << ' ';
        for (auto v : adj[u]) {
            if (!vis2[v]) {
                ans[u].push_back(v);
                vis2[v] = 1;
                q.push(v);
            }
        }
    }

    if (cnt != n) {
        // cout << cnt;
        cout << "No\n";
    } else {
        int p = 0;
        for (int i = 1; i <= n; i++) {
            if (ans[i].size()) {
                p++;
            }
        }
        cout << "Yes\n" << p << '\n';
        for (int i = 1; i <= n; i++) {
            if (ans[i].size()) {
                cout << i << ' ' << ans[i].size() << ' ';
                for (auto x : ans[i]) {
                    cout << x << ' ';
                }
                cout << '\n';
            }
        }
    }
    

    return 0;
}