#include<bits/stdc++.h>
#define ll long long
#define N 500005
#define endl "\n" 
#define fi first
#define se second
using namespace std;
const ll mod=1e9+7;
const ll inf=1e18;
const double eps=1e-6;
ll n,m,k;
ll vis[N],fl[N],cnt[N];
vector<ll>v[N];
vector<ll>ans[N];
void dfs(ll x){
    fl[x]=1;
    if(vis[x])return ;
    for(auto y:v[x]){
        if(fl[y])continue;
        ans[x].push_back(y);
        dfs(y);
    }
}
void dfs2(ll x){
    fl[x]=1;
    if(vis[x])return ;
    if(ans[x].size()>0){
        cout<<x<<" "<<ans[x].size()<<" ";
        for(auto y:ans[x])cout<<y<<" ";
        cout<<endl;
    }
    for(auto y:v[x]){
        if(fl[y])continue;
        dfs2(y);
    }
}
int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++){
        ll x;
        cin>>x; 
        vis[x]=1;
    }
    for(int i=1;i<=m;i++){
        ll x,y;
        cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]&&!fl[i]){
            dfs(i);
            break;
        }
    }
    for(int i=1;i<=n;i++){
        if(!fl[i]){
            cout<<"No\n";
            return 0;
        }
        fl[i]=0;
    }
    cout<<"Yes\n";
    for(int i=1;i<=n;i++)if(!vis[i]&&!fl[i])dfs2(i);
    return 0;
}