#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define inf 1000000000
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int> >;

vector<vector<int> > dist;
void rec(const Graph& G, int p, int v, int n) {
    dist[p][v] = n;
    for(int next_v : G[v]) {
        if(dist[p][next_v] != -1) continue;
        rec(G, p, next_v, n+1);
    }
}

int main() {
    // 高速化
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // 小数点の出力桁数を指定
    cout << fixed << setprecision(10);

    // メイン
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> X(K);
    rep(i, 0, K) cin >> X[i];
    Graph G(N);
    rep(i, 0, M) {
        int u, v;
        cin >> u >> v; u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dist.assign(K, vector<int>(N, -1));
    rep(i, 0, K) {
        rec(G, i, X[i]-1, 0);
    }
    rep(i, 0, N) {
        bool ok = true;
        rep(j, 1, K) if(dist[j-1][i] != dist[j][i]) ok = false;
        if(ok) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;

    return 0;
}