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

constexpr int N = 2E5+10;
int f[N];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }

vector<int> G[N];
vector<int> H[N];
set<int> leaf;

vector<vector<int>> ans;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m, k;
    cin >> n >> m >> k;
    if (k == n){
        cout << "No\n";
        return 0;
    }

    for (int i = 1 ; i <= k; i++){
        int x; cin >> x;
        leaf.insert(x);
    }
    iota(f, f + n + 1, 0);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        if (leaf.count(x) ^ leaf.count(y)) {
            H[x].push_back(y);
            H[y].push_back(x);
        }
        if (leaf.count(x) || leaf.count(y)) continue;
        int fx = find(x), fy = find(y);
        if (fx != fy) {
            G[x].push_back(y);
            G[y].push_back(x);
            f[fx] = fy;
        }
    }

    for (auto x : leaf) {
        if (H[x].empty()) {
            cout << "No\n";
            return 0;
        }
        int y = H[x][0];
        G[y].push_back(x);
        f[find(x)] = find(y);
    }
    int f1 = find(1);
    for (int i = 1; i <= n; i++) {
        if (find(i) != f1) {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    queue<int> Q;
    for (int i = 1; i <= n; i++) {
        if (leaf.count(i)) continue;
        Q.push(i);
        break;
    }
    vector<bool> vis(n + 1, 0);
    while (!Q.empty()) {
        int x = Q.front(); Q.pop();
        vis[x] = 1;
        // cerr <<x <<'\n';
        vector<int> son;
        son.push_back(x);
        son.push_back(0);
        for (int y : G[x]) {
            if (vis[y]) continue;
            son.push_back(y);
            // vis[y] = 1;
            son[1]++;
            Q.push(y);
        }
        if (son.size() > 2) ans.push_back(son);
    }
    cout << ans.size() << '\n';
    for (auto v : ans) {
        for (auto x : v) cout << x << ' ';
        cout << '\n';
    }
    return 0;
}