//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 5e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m, k, f[N];
vector<int> ed[N];
pii E[N];
int find(int x) {return x == f[x] ? x : f[x] = find(f[x]);}
bool merge(int u, int v) {
    int p = find(u), q = find(v);
    if(p == q) return false;
    f[p] = q;
    return true;
}
vector<int> tr[N]; 

vector<int> res[N];
vector<int> now;

void dfs(int u, int fa) {
    now.push_back(u);
    res[fa].push_back(u);
    for(auto v : tr[u]) {
        if(v == fa) continue;
        dfs(v, u);
    }
}
void sol() {
    cin >> n >> m >> k;
    vector<int> b(k + 1);
    vector<int> vst(n + 1);
    F(i, 1, k) cin >> b[i], vst[b[i]] = 1;
    int idx = 0;
    F(i, 1, m) {
        int u, v; cin >> u >> v;
        if(vst[u] && vst[v]) continue;
        if(vst[u]) ed[u].pb(v);
        else if(vst[v]) ed[v].pb(u);
        else E[++ idx] = {u, v};
    } 
    F(i, 1, n) f[i] = i;
    F(i, 1, idx) {
        auto [u, v] = E[i];
        if(merge(u, v)) tr[u].push_back(v), tr[v].push_back(u);
    }
    map<int, int> cnt;
    F(i, 1, n) {
        if(vst[i]) {
            if(! ed[i].size()) {
                cout << "No\n";
                return;
            }
            tr[ed[i][0]].push_back(i), tr[i].push_back(ed[i][0]);
        } else {
            cnt[find(i)] ++;
        }
    }
    if(cnt.size() != 1) {
        cout << "No\n";
        return;
    }
    int st = -1;
    F(i, 1, n) if(! vst[i]) st = i;
    if(st == -1) {
        cout << "No\n";
        return;
    }
    dfs(st, 0);
    cout << "Yes\n";
    int qaq = 0;
    for(auto x : now) if(res[x].size()) qaq ++;
    cout << qaq << "\n";
    for(auto x : now) if(res[x].size()) {
        cout << x << " " << res[x].size() << " ";
        for(auto v : res[x]) cout << v << " "; cout << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl