#include<bits/stdc++.h>

#define ll long long
#define alls(x) x.begin(),x.end()
#define ull unsigned long long
#define lowbit(x) x&-x
#define lc p<<1
#define rc p<<1|1
#define PII pair<int,int>
#define vi vector<int>
//#define int long long

using namespace std;
const ll inf = 2e18;
const int mod = 998244353;
const int N = 5e5 + 10;
int e[2 * N], ne[2 * N], h[N], idx;

void add(int x, int y) {
    e[idx] = y;
    ne[idx] = h[x];
    h[x] = idx++;
}

void solve() {
    memset(h, -1, sizeof(h));
    vector<PII > point;
    int n, m, k;
    cin >> n >> m >> k;
    int x, y;
    vector<bool> vis(n + 1);
    vi K(k);
    for (int i = 0; i < k; i++) {
        cin >> K[i];
        vis[K[i]] = true;
    }
    for (int i = 0; i < m; i++) {
        cin >> x >> y;
        if (vis[x] || vis[y]) {
            if (vis[x] && vis[y])continue;
            if (vis[x])point.push_back({y, x});
            else point.push_back({x, y});
            continue;
        } else {
            add(x, y);
            add(y, x);
        }
    }
    vector<bool>v(n+1);
    vector<vector<int>> E(n + 1);
    function<void(int)> dfs = [&](int x) {
//        vis[x] = true;
        for (int i = h[x]; i != -1; i = ne[i]) {
            int j = e[i];
            if (!vis[j]) {
                v[j] = true;
                vis[j] = true;
                E[x].push_back(j);
                dfs(j);
            }
        }
    };
    int id = -1;
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            vis[i] = true;
            dfs(i);
            id = i;
            break;
        }
    }
    for(auto i:K)vis[i] = false;
    for(auto i:point)
    {
        if(vis[i.first])vis[i.second] = true;
    }
    if (id == -1) {
        cout << "No\n";
        return;
    }
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
//    for(auto i:v)
//    {
//        cout<<i<<" ";
//    }
//    cout<<endl;
    for (auto &[x, y]: point) {
        if (!v[y]) {
            E[x].push_back(y);
            v[y] = true;
        }
    }
    int ans = 0;
    for (auto i: E) {
        if (!i.empty())
            ans++;
    }
    cout << ans << '\n';
    queue<int> q;
    q.push(id);
    while (q.size()) {
        int u = q.front();
        q.pop();
        cout << u << " ";
        cout << E[u].size() << " ";
        for (auto i: E[u]) {
            if (!E[i].empty()) {
                q.push(i);
            }
            cout << i << " ";
        }
        cout << '\n';
    }
}

signed main() {
    cout << fixed << setprecision(6);
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while (_--)solve();
}