#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
#define fi first
#define se second 
#define V vector
#define pb push_back

struct SCC {
    static const int N = 1e6 + 10;
    int n;
    V<int> e[N];
    int cnt;
    int dfn[N], bel[N], low[N], tot;
    bool ins[N];
    stack<int, V<int>> st;

    void ini(int nn) {
        n = nn;
        tot = 0;
        cnt = 0;
        for(int i = 1; i <= n; i++) ins[i] = 1, dfn[i] = 0;
        for(int i = 1; i <= n; i++) e[i].clear();
    }

    void add(int a, int b) {
        e[a].pb(b);
    }

    void dfs(int x) {
        low[x] = dfn[x] = ++tot;
        st.push(x);
        for(auto y : e[x]) {
            if(!dfn[y]) dfs(y);
            if(ins[y]) low[x] = min(low[x], low[y]);
        }
        if(low[x] == dfn[x]) {
            cnt++;
            int lst = 0;
            do {
                ins[st.top()] = 0;
                bel[st.top()] = cnt;
                lst = st.top();
                st.pop();
            } while(lst != x);
        }
    }
    void tarjan() {
        for(int i = 1; i <= n; i++) if(!dfn[i]) dfs(i);
        for(int i = 1; i <= n; i++) bel[i] = cnt - bel[i] + 1;
    }
}scc;

void solve() {
    int n; cin >> n;
    int m, k; cin >> m >> k;
    scc.ini(n);
    V<int> lazy_boy(n + 1);
    for(int i = 1; i <= k; i++) {
        int t; cin >> t;
        lazy_boy[t] = 1;
    }
    for(int i = 1; i <= m; i++) {
        int a, b; cin >> a >> b;
        if(!lazy_boy[a]) scc.add(a, b);
        if(!lazy_boy[b]) scc.add(b, a);
    }
    scc.tarjan();
    int st = -1;
    for(int i = 1; i <= n; i++) {
        if(scc.bel[i] == 1) {
            st = i;
        }
    }
    assert(st != -1);

    queue<int> que;
    V<int> vis(n + 1);
    que.push(st);
    vis[st] = 1;
    V<V<int>> ans;
    while(que.size()) {
        int x = que.front();
        que.pop();
        ans.pb({x});
        for(auto y : scc.e[x]) {
            if(vis[y]) continue;
            vis[y] = 1;
            ans.back().pb(y);
            que.push(y);
        }
    }
    if(accumulate(vis.begin() + 1, vis.end(), 0) == n) {
        cout << "Yes" << endl;
        int say_first = 0;  
        for(auto v : ans) {
            if(v.size() >= 2) say_first++;
        }
        cout << say_first << endl;
        for(auto v : ans) {
            if(v.size() == 1) continue;
            cout << v[0] << " ";
            cout << v.size() - 1 << " ";
            for(int i = 1; i < v.size(); i++) cout << v[i] << " ";
            cout << "\n";
        }
    } else cout << "No" << endl;

}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    // int t; cin >> t;
    //while(t--) 
    solve();
}