#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int f[N],n,m,k,a[N];
bool v[N],g[N];
inline int find(int x){
  return f[x]==x?x:f[x]=find(f[x]);
}
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define repn(x) rep(x,1,n)
vector<int>p[N];
struct node{
  int x;
  vector<int>p;
};
int dep[N];
vector<node>P;
#define pb push_back
inline void bfs(){
  repn(i)dep[i]=-1;
  queue<int>q;
  repn(i)if(!v[i]){
    dep[i]=1;
    q.push(i);
    break;
  }
  int t=0;
  P.pb({0,{}});
  int w=0;
  while(!q.empty()){
    int x=q.front();q.pop();
    t++;
    P.pb({});
    P[t].x=x;
    bool fl=0;
    for(auto y:p[x])if(dep[y]==-1)dep[y]=dep[x]+1,q.push(y),P[t].p.pb(y),fl=1;
    if(fl)w++;
  }
  cout <<w<<'\n';
  rep(i,1,t){
    if((int)P[i].p.size()==0)continue;
    cout <<P[i].x<<' ';
    cout <<(int)P[i].p.size()<<' ';
    for(auto x:P[i].p)cout <<x<<' ';
    cout <<'\n';
  }
}
int main(){
  cin>>n>>m>>k;
  if(k==n)return puts("No"),0;
  rep(i,1,k)cin>>a[i],v[a[i]]=1;
  repn(i)f[i]=i;
  rep(i,1,m){
    int x,y;
    cin>>x>>y;
    if(!v[x])g[y]=1;
    if(!v[y])g[x]=1;
    if(!v[x]&&!v[y])f[find(x)]=find(y);
    if(!v[x])p[x].pb(y);
    if(!v[y])p[y].pb(x);
  }
  int Fa=0;
  repn(i)if(!v[i]){
    if(!Fa)Fa=find(i);
    else if(find(i)!=Fa)return puts("No"),0;
  }
  repn(i)if(v[i]&&!g[i])return puts("No"),0;
  puts("Yes");
  bfs();
  return 0;
}