#include<bits/stdc++.h>
#define endl '\n'
#define all(x) x.begin(),x.end()
#define ios ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;

void solve() {
    ll n, m , k;
    cin >> n  >> m >> k;
    vector<vector<ll>> G(n);
    vector<ll> b(k);
    for(auto&& i : b) {
        cin >> i;
        i--;
    }
    set<ll> setb(b.begin(), b.end());
    while(m--) {
        ll u, v;
        cin >> u >> v;
        u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    ll start = -1;
    for(int i = 0 ; i < n ; i++) {
        if(!setb.count(i)) {
            start = i;
            break;
        }
    }
    if(start == -1) {
        cout << "NO" << endl;
        return;
    }
    string ans;
    queue<ll> q;
    set<ll> vis;
    q.push(start);
    vis.insert(start);
    ll numline = 0;
    while(!q.empty()) {
        ll t = q.front();
        q.pop();
        ll cnt = 0;
        vector<ll> rec;
        for(auto v : G[t]) {
            if(!vis.count(v)) {
                cnt++;
                rec.push_back(v);
                if(!setb.count(v)) {
                    q.push(v);
                }
                vis.insert(v);
            }
        }
        if(cnt > 0) {
            numline++;
            ans += to_string(t + 1) + ' ';
            ans += to_string(cnt) + ' ';
            for(auto i : rec) {
                ans += to_string(i + 1) + ' ';
            }
        }
        ans += endl;
    }
    if(vis.size() != n) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
        cout << numline << endl;
        cout << ans;
    }
}

signed main() {
    ios;
    int _ = 1;
    //cout << fixed << setprecision(2);
    //cin >> _;
    while(_--) solve();
    return 0;
}