#include<bits/stdc++.h>
typedef long long ll;
const int maxn = 2e5 + 1000;
int a[maxn],flag[maxn];
int dfn[maxn];
int p[maxn];
using pii = std::pair<int,int>;
pii edge[(int)5e5 + 1000];
std::vector<int>g[maxn];
int find(int x){
    return p[x]==x?x:p[x]=find(p[x]);
}
void unite(int x,int y){
    int X = find(x),Y = find(y);
    if(X==Y)return;
    p[X] = Y;
}
void solve(){
    int n,m,k;
    std::cin >> n >> m >> k;
    std::iota(p + 1,p + 1 + n,1);
    for(int i = 1;i <= k;i++){
        std::cin >> a[i];
        flag[a[i]] = 1;
    }
    for(int i = 1;i <= m;i++){
        std::cin >> edge[i].first >> edge[i].second;
        g[edge[i].first].push_back(edge[i].second);
        g[edge[i].second].push_back(edge[i].first);
        if(flag[edge[i].first] == 0 and flag[edge[i].second] == 0){
            unite(edge[i].first,edge[i].second);
        }
    }
    std::map<int,int>mp;
    int p = 0;
    for(int i = 1;i <= n;i++){
        if(flag[i] == 0){
            mp[find(i)] = 1;
            p = find(i);
        }
    }
    if(mp.size() > 1){
        std::cout << "No\n";
        return;
    }
    std::queue<int>q;
    q.push(p);
    int cnt = 0;
    std::vector<std::vector<int>>ans;
    while(!q.empty()){
        auto u = q.front();
        q.pop();
        cnt++;
        dfn[u] = 1;
        if(flag[u])continue;
        std::vector<int>tmp;
        tmp.push_back(u);
        for(auto v : g[u]){
            if(dfn[v] == 0){
                dfn[v] = 1;
                q.push(v);
                tmp.push_back(v);
            }
        }
        if(tmp.size() > 1){
            ans.push_back(tmp);
        }
    }
    if(cnt != n){
        std::cout << "No\n";
        return;
    }
    std::cout << "Yes\n";
    std::cout << ans.size() << "\n";
    for(auto x : ans){
        std::cout << x[0] << " " << x.size() - 1 << " ";
        for(auto y : x){
            if(y == x[0])continue;
            std::cout << y << " ";
        }
        std::cout << "\n";
    }
    // std::cout << "Yes\n"
}
int main(){
    std::ios::sync_with_stdio(0);
    std::cin.tie(0),std::cout.tie(0);
    int t = 1;
    // std::cin >> t;
    while(t--){
        solve();
    }
    return 0;
}