#include <bits/stdc++.h>
using namespace std;
static constexpr int Maxn = 2e5 + 5, Maxm = 5e5 + 5;
int n, m, k, ck;
int a[Maxn], bad[Maxn], fa[Maxn], eu[Maxm], ev[Maxm], vis[Maxn];
vector<int> g[Maxn];
int fnd(int x) { return x == fa[x] ? x : fa[x] = fnd(fa[x]); }
void join(int x, int y) { x = fnd(x), y = fnd(y); if (x != y) fa[x] = y; }
void add_edge(int u, int v) { g[u].push_back(v), g[v].push_back(u); }
vector<pair<int, vector<int>>> ans;
int main(void) {
  cin.tie(nullptr)->sync_with_stdio(false);
  cin >> n >> m >> k;
  if (k == n) { cout << "No\n"; return 0; }
  for (int i = 1; i <= k; ++i) cin >> a[i], bad[a[i]] = true;
  for (int i = 1; i <= m; ++i) cin >> eu[i] >> ev[i], add_edge(eu[i], ev[i]);
  for (int i = 1; i <= n; ++i) fa[i] = i; ck = 0;
  for (int i = 1; i <= m; ++i)
    if (!bad[eu[i]] && !bad[ev[i]]) join(eu[i], ev[i]);
  for (int i = 1; i <= n; ++i) ck += (fa[i] == i);
  if (ck != k + 1) { cout << "No\n"; return 0; }
  for (int i = 1; i <= k; ++i) {
    int cv = 0; for (int v: g[a[i]]) cv += !bad[v];
    if (cv == 0) { cout << "No\n"; return 0; }
  } queue<int> que;
  for (int i = 1; i <= n; ++i) if (!bad[i])
  { que.push(i); vis[i] = true; break; }
  while (!que.empty()) {
    int u = que.front(); que.pop();
    if (bad[u]) continue;
    vector<int> cur;
    for (int v: g[u]) if (!vis[v])
      cur.push_back(v), que.push(v), vis[v] = true;
    ans.emplace_back(u, cur);
  } cout << "Yes\n";
  cout << (int)ans.size() << endl;
  for (const auto &[x, y]: ans) {
    cout << x << ' ' << (int)y.size();
    for (const int &z: y) cout << ' ' << z; cout << endl;
  } return 0;
} // main