#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


void solve(){
    int n, m, k; cin >> n >> m >> k;
    vector<int> x(k);
    for(int i=0; i<k; i++){
        cin >> x[i];
        x[i]--;
    }
    
    vector<vector<bool>> A(n, vector<bool>(n, false));
    for(int i=0; i<m; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        A[u][v] = A[v][u] = true;
    }

    vector<vector<vector<bool>>> dp(n, vector<vector<bool>>(n, vector<bool>(1<<n, false)));

    // dp
    for(int s=0; s<n; s++){
        dp[s][s][1<<s] = true;
        for(int bit=1; bit<(1<<n); bit++){
            for(int i=0; i<n; i++) if((bit>>i)&1){
                int bit2 = bit ^ (1<<i);
                for(int j=0; j<n; j++) if(((bit2>>j)&1) && A[i][j]){
                    dp[s][i][bit] = dp[s][i][bit] | dp[s][j][bit2];
                }
            }
        }
    }

    vector<vector<vector<bool>>> reachable(n, vector<vector<bool>>(n, vector<bool>(n+1, false)));
    for(int s=0; s<n; s++)for(int t=0; t<n; t++){
        for(int bit=0; bit<(1<<n); bit++){
            int cnt = 0;
            for(int i=0; i<n; i++) if((bit>>i)&1) cnt++;
            reachable[s][t][cnt] = reachable[s][t][cnt] | dp[s][t][bit];
        }
    }

    for(int l=0; l<=n; l++){
        for(int t=0; t<n; t++){
            bool ok = true;
            for(int i=0; i<k; i++) ok &= reachable[x[i]][t][l];
            if(ok){
                cout << "Yes\n";
                return;
            }
        }
    }

    cout << "No\n";
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}