#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,k;
ll f[200010];
ll bj[200010];
ll bj1[200010];
vector<ll>e[200010];
ll find(ll x)
{
    if(f[x]==x)return x;
    f[x]=find(f[x]);
    return f[x];
}
vector<ll>e1[200010];
vector<ll>t;
ll cnt=0;
void dfs1(ll x,ll pre)
{
    ll fl=0;
    for(auto y:e[x])
    {
        if(y==pre)continue;
        if(bj[y])
        {
            if(bj1[y]==0)
            {
                fl=1;
                bj1[y]=1;
            }
        }
        else
        {
            fl=1;
        }
    }
    cnt+=fl;
    for(auto y:e[x])
    {
        if(y==pre||bj[y])continue;
        dfs1(y,x);
     }  
}
void dfs2(ll x,ll pre)
{
    ll fl=0;
    for(auto y:e[x])
    {
        if(y==pre)continue;
        if(bj[y])
        {
            if(bj1[y]==0)fl++;
        }
        else
        {
            fl++;
        }
    }
    if(fl>0)
    {
        cout<<x<<' '<<fl<<' ';
        for(auto y:e[x])
        {
            if(y==pre)continue;
            if(bj[y])
            {
                if(bj1[y]==0)
                {
                    cout<<y<<' ';
                    bj1[y]=1;
                }
            }
            else
            {
                cout<<y<<' ';
            }
        }
        cout<<'\n';
    }
    for(auto y:e[x])
    {
        if(y==pre||bj[y])continue;
        dfs2(y,x);
    }
}
void work()
{
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)f[i]=i;
    for(int i=1;i<=k;i++)
    {
        ll x;
        cin>>x;
        t.push_back(x);
        bj[x]=1;
    }
    for(int i=1;i<=m;i++)
    {
        ll x,y;
        cin>>x>>y;
        //cout<<x<<' '<<y<<'\n';
        if(bj[x]||bj[y])
        {
            //cout<<x<<' '<<y<<'\n';
            if(bj[x]&&bj[y])continue;
            e[x].push_back(y);
            e[y].push_back(x);
            if(bj[x])bj1[x]=1;
            else bj1[y]=1;
            continue;
        }
        //cout<<x<<' '<<y<<'\n';
        if(find(x)==find(y))continue;
        //cout<<find(x)<<' '<<find(y)<<'\n';
        f[find(x)]=find(y);
        e[x].push_back(y);
        e[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
    {
        cnt+=(f[i]==i);
    }
    if(cnt!=k+1)
    {
        cout<<"No\n";
        return;
    }
    for(auto x:t)
    {
        if(bj1[x]==0)
        {
            cout<<"No\n";
            return;
        }
    }
    for(int i=1;i<=n;i++)bj1[i]=0;
    cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(bj[i]==0)
        {
            dfs1(i,0);
            break;
        }
    }
    for(int i=1;i<=n;i++)bj1[i]=0;
    cout<<"Yes\n";
    cout<<cnt<<'\n';
    for(int i=1;i<=n;i++)
    {
        if(bj[i]==0)
        {
            dfs2(i,0);
            break;
        }
    }
}
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;
    //cin>>T;
    while(T--)
    {
        work();
    }
}