#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2e5 + 10;
vector<int> adj[N];

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int, vector<int>>> ans;

    vector<int> vis(n + 10, 0);
    for (int i = 1; i <= k; i++) {
        int t;
        cin >> t;
        vis[t] = 1;
    }

    for (int i = 1; i <= m; i++) {
        int p, q;
        cin >> p >> q;
        adj[p].push_back(q);
        adj[q].push_back(p);
    }

    queue<int> Q;
    int cnt = 0;
    vector<int> vis2(n + 10, 0);
    for (int i = 1; i <= n; i++) {
        if(!vis[i]) {
            Q.push(i);
            vis2[i] = 1;
            ++cnt;
            break;
        }
    }
    while(Q.size()) {
        int u = Q.front();
        Q.pop();
        if(vis[u] == 1) continue;
        vector<int> res;
        for (auto v : adj[u]) {
            if(++vis2[v] == 1) {
                Q.push(v);
                cnt++;
                res.push_back(v);
            }
        }
        if(res.size() == 0) continue;
        ans.push_back({u, res});
    }

    if(cnt == n) {
        cout << "Yes\n";
        for (auto [u, res] : ans) {
            cout << u << " ";
            cout << res.size() << " ";
            for (auto it : res) {
                cout << it << " ";
            }
            cout << "\n";
        }
    } else {
        cout << "No\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}