#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
#define no { puts("No"); return; }
#define yes { puts("Yes"); return; }
using namespace std;
const int maxn = 200010;
int n, m, k, f[maxn];
bool ins[maxn], busy[maxn];
vector < vector < int > > res;
vector < int > e[maxn];
int find(int x) { return f[x] == x ? f[x] : f[x] = find(f[x]); }
void dfs(int u, int fa) {
    vector < int > cur;
    cur.push_back(u);
    for(auto v : e[u]) if(v != fa && !ins[v]) {
        cur.push_back(v);
        ins[v] = 1;
    }
    if(cur.size() == 1) return;
    res.push_back(cur);
    for(int i = 1; i < cur.size(); i ++)
        if(!busy[cur[i]]) dfs(cur[i], u);
}
void solve() {
    cin >> n >> m >> k;
    rep(i, 1, n) f[i] = i, ins[i] = busy[i] = 0, e[i].clear();
    rep(i, 1, k) {
        int x;
        cin >> x;
        busy[x] = 1;
    }
    rep(i, 1, m) {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v), e[v].push_back(u);
        if(!busy[u] && !busy[v]) {
            int r1 = find(u), r2 = find(v);
            if(r1 == r2) continue;
            f[r1] = r2;
        } else if(!(busy[u] && busy[v])) {
            if(busy[u]) ins[u] = 1;
            else ins[v] = 1;
        }
    }
    int id = -1;
    rep(i, 1, n) if(f[i] == i && !busy[i]) { id = i; break; }
    if(id == -1) {
        cout << "No\n";
        return;
    }
    rep(i, 1, n) if((!busy[i] && f[i] != id) || (busy[i] && !ins[i])) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    rep(i, 1, n) ins[i] = 0;
    res.clear();
    dfs(id, 0);
    cout << res.size() << '\n';
    for(auto a : res) {
        cout << a[0] << ' ' << a.size() - 1;
        rep(i, 1, a.size() - 1) cout << ' ' << a[i];
        cout << '\n';
    }
}

int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while(T --) solve();
    return 0;
}