#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> x(k);
    rep(i,k) cin >> x[i];
    rep(i,k) --x[i];
    vector<vector<int>> g(n);
    rep(i,m) {
        int u, v;
        cin >> u >> v;
        --u;--v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<vector<vector<int>>> dp(1<<n, vector<vector<int>>(n, vector<int>(n)));
    rep(i,k) dp[1<<x[i]][x[i]][x[i]] = 1;
    rep(i,1<<n)rep(j,n)rep(l,n) {
        if(!dp[i][j][l]) continue;
        for(int v : g[j]) {
            if(i>>v&1) continue;
            dp[i|1<<v][v][l] = 1; 
        }
    }
    for(int i=1;i<=n;i++) {
        rep(j,n) {
            int cnt = 0;
            rep(l,k) {
                rep(t,1<<n) {
                    if(__builtin_popcount(t)!=i) continue;
                    if(dp[t][j][x[l]]) {
                        cnt++;        
                        break;
                    }
                }
            }
            dbg(cnt, i, j);
            if(cnt==k) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl; 
    return 0;
}