#include<bits/stdc++.h>
using namespace std ;

typedef long long LL ;
const int N = 2e5+10 , M = 5e5+10 ;

int n , m , K , a[N] ;
int bin[N] ;
int Find( int x ) { return x==bin[x]?x:bin[x]=Find(bin[x]) ; }
int du[N] ;
bool is[N] ;
vector<int> E[N] ;
int yuan[N] ;
vector<int> op[N] ;
int step ;
void dfs( int x , int fa )
{
	if( x == 1 || E[x].size()>1 ) { // 非叶子 
		yuan[++step] = x ;
		for(int t : E[x] ) {
			if( t == fa ) continue ;
			op[step].push_back(t) ;
			dfs(t,x) ;
		}
	}
}
  
int main()
{
	scanf("%d%d%d" , &n , &m , &K ) ;
	for(int i = 1 ; i <= n ; i ++ ) bin[i] = i ;
	for(int i = 1 ; i <= K ; i ++ ) {
		scanf("%d" , &a[i] ) ;
		is[a[i]] = 1 ;
	}
	int x , y ; 
	for(int i = 1 ; i <= m ; i ++ ) {
		scanf("%d%d" , &x , &y ) ;
		if( Find(x)!=Find(y) ) {
			if( !is[x]&&!is[y] ) bin[Find(x)] = Find(y) , E[x].push_back(y) , E[y].push_back(x) ;
			else if( is[x] && is[y] ) continue ;
			else if( is[x] ) {
				if( du[x]==0 ) {
					bin[Find(x)] = Find(y) ;
					du[x] ++ , E[x].push_back(y) ; E[y].push_back(x) ;
				}
			} 
			else {
				if( du[y]==0 ) {
					bin[Find(y)] = Find(x) ;
					du[y] ++ ; E[x].push_back(y) ; E[y].push_back(x) ;
				}
			}
		}
	}
	int rt = Find(1) ;
	for(int i = 2 ; i <= n ; i ++ ) {
		if( rt!=Find(i) ) {
			printf("No\n") ;
			return 0 ;
		}
	}
	dfs(rt,0) ;
	printf("Yes\n%d\n" , step ) ;
	for(int i = 1 ; i <= step ; i ++ ) {
		printf("%d %d " , yuan[i] , op[i].size() ) ;
		for(int id : op[i] ) printf("%d " , id ) ;
		printf("\n") ;
	}
 	return 0 ;
}