#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define pre(i, l, r) for(int i = (l); i >= (r); i --)
#define Grp(x, i) for(int i = h[x]; i; i = ne[i])
using namespace std;

typedef long long LL;
const int N = 200009;
const int M = 500009;

inline int read() {
    int x = 0; char fs = 0, c = getchar(); while(! isdigit(c)) fs |= (c == '-'), c = getchar();
    while(isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = getchar();
    return fs ? -x : x;
}

int n, m, k;
int mark[N];
int h[N], to[M << 1], ne[M << 1], tot;
vector<int> ans[N];
int vis[N];

inline void add(int x, int y) {
    ne[++ tot] = h[x], h[x] = tot, to[tot] = y;
}

void Fyr(int x) {
    vis[x] = 1;
    Grp(x, i) {
        int y = to[i];
        if(! mark[y] && ! vis[y]) {
            ans[x].emplace_back(y);
            Fyr(y);
        }
        if(mark[y] && ! vis[y]) ans[x].emplace_back(y), vis[y] = 1;
    }
}

void Sek(int x) {
    if(ans[x].empty()) return;
    int lim = ans[x].size() - 1;
    printf("%d %d ", x, lim + 1);
    rep(i, 0, lim) printf("%d%c", ans[x][i], " \n"[i == lim]);
    for(const int& y : ans[x]) {
        if(! mark[y]) Sek(y);
    }
}

int main() {
    n = read(), m = read(), k = read();
    rep(i, 1, k) mark[read()] = 1;
    rep(i, 1, m) {
        int x = read(), y = read();
        add(x, y), add(y, x);
    }
    int root = 0;
    rep(i, 1, n) if(! mark[i]) {
        root = i;
        Fyr(i);
        break;
    }
    rep(i, 1, n) if(! vis[i]) return printf("No\n"), 0;
    int cnt = 0;
    rep(i, 1, n) if(! ans[i].empty()) cnt ++;
    printf("Yes\n%d\n", cnt);
    Sek(root);
    return 0;
}