#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 5e5 + 10;

int vis[N], ok[N], a[N];
vector<int> p[N], ans[N];

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= k; i++)
    {
        int x;
        cin >> x;
        a[x] = 1;
    }
    while (m--)
    {
        int u, v;
        cin >> u >> v;
        p[u].pb(v), p[v].pb(u);
    }
    int now = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] || (now >= 1 && !vis[i]))
            continue;
        now++;
        vis[i] = 1;
        for (int j : p[i])
        {
            if (!vis[j])
            {
                ans[i].pb(j);
                vis[j] = 1;
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i])
        {
            cout << "No\n";
            return;
        }
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!ans[i].empty())
            cnt++;
    }
    cout << "Yes\n";
    cout << cnt << endl;
    for (int i = 1; i <= n; i++)
    {
        if (!ans[i].empty())
        {
            cout << i << " " << ans[i].size() << " ";
            for (auto j : ans[i])
                cout << j << " ";
            cout << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
    // cin >> _;

    while (_--)
        solve();

    return 0;
}