#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M, K; cin >> N >> M >> K;
    vector<int> X(K);
    rep(i, K) cin >> X[i], X[i]--;
    Graph g(N);
    rep(i, M){
        int U, V; cin >> U >> V;
        U--, V--;
        g[U].push_back(V);
        g[V].push_back(U);
    }

    int N2 = 1 << N;
    vector f(N, vector(N, vector<int>(N))); // f[st][en][time];
    rep(st, N){
        vector dp(N, vector<int>(N2));
        dp[st][(1 << st)] = 1;
        rep(s, N2)rep(now, N){
            if((~s >> now) & 1) continue;
            if(!dp[now][s]) continue;
            for(int nxt : g[now]){
                if((s >> nxt) & 1) continue;
                dp[nxt][s | (1 << nxt)] = 1;
            }
        }

        rep(s, N2)rep(now, N)if(dp[now][s]){
            int pc = __builtin_popcount(s);
            f[st][now][pc - 1] = 1;
        }
    }

    rep(en, N)rep(t, N){
        bool is_ok = true;
        rep(i, K)if(!f[X[i]][en][t]) is_ok = false;
        if(is_ok) {
            cout << "Yes" << endl;
            return 0;
        }
    }

    cout << "No" << endl;
}