#include <bits/stdc++.h>
#define rep(i, j, k) for(int i=(j);i<=(k);++i)
#define per(i, j, k) for(int i=(j);i>=(k);--i)
#define mem(a, b) memset(a,b,sizeof(a))
#define pii pair<int,int>
#define sz(x) (int)(x).size()
#define lson (p<<1)
#define rson (p<<1|1)
#define int long long
#define pb push_back
#define eb emplace_back
#define enter putchar('\n')
#define space putchar(' ')
#define yes "Yes"
#define no "No"
const int mod=998244353, N=2e5+5, INF=0x3f3f3f3f3f3f3f3f;
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') f = c == '-' ? -1 : f, c = getchar();
  while (c >= '0' && c <= '9') x = (x<<3)+(x<<1)+(c^48), c = getchar();
  return x*f;
}
inline void write(int x) {
  if (x < 0) x = -x, putchar('-');
  if (x > 9) write(x/10);
  putchar('0' + x%10);
}

vector<int> e[N];

void solve() {
  int n = read(), m = read(), k = read();
  set<int> s;
  rep(i, 1, k) s.insert(read());
  rep(i, 1, m) {
    int p = read(), q = read();
    if (!s.count(p) && !s.count(q))
      e[q].pb(p), e[p].pb(q);
    else if (s.count(p) && !s.count(q))
      e[q].pb(p);
    else if (s.count(q) && !s.count(p))
      e[p].pb(q);
  }
  vector<vector<int>> ans(n + 1);
  vector<bool> vis(n + 1);
  queue<int> q;
  rep(i, 1, n)
    if (!s.count(i)) {
      q.push(i);
      vis[i] = true;
      break;
    }
  int t = 0;
  while(!q.empty()) {
    int u = q.front();
    q.pop();
    for(auto& v: e[u]) {
      if (!vis[v]) {
        vis[v] = true;
        q.push(v);
        ans[u].pb(v);
      }
    }
    if (sz(ans[u])) t ++;
  }
  rep(i, 1, n) {
    if (!vis[i]) {
      puts(no);
      return;
    }
  }
  puts(yes);
  write(t), enter;
  rep(i, 1, n) {
    if (sz(ans[i])) {
      write(i), space;
      write(sz(ans[i])), space;
      for(auto& v: ans[i]) {
        write(v), space;
      }
      enter;
    }
  }
}

signed main() {
  int t = 1;
  //t = read();
  while(t --) {
    solve();
  }
  return 0;
}