#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, k; cin >> n >> m >> k;
    vi x(k); rep(i, k){
        cin >> x[i];
        x[i]--;
    }
    vvi e(n, vi(n, 0));
    rep(i, m){
        int u, v; cin >> u >> v;
        u--; v--;
        e[u][v] = e[v][u] = 1;
    }
    vvvi vvv(k, vvi(n, vi(n, 0)));
    rep(i, k){
        vector<vector<bool>> dp(1<<n, vector<bool>(n, false));
        dp[1<<x[i]][x[i]] = true;
        vvv[i][0][x[i]] = 1;
        rep2(j, 1, 1<<n){
            bitset<15> bs(j);
            int a = bs.to_ulong();
            if(bs.count() == 1)continue;
            rep(l, n){
                if(!bs[l])continue;
                bs.reset(l);
                rep(f, n){
                    if(!bs[f])continue;
                    if(dp[bs.to_ulong()][f] && e[f][l] == 1){
                        dp[a][l] = true;
                        break;
                    }
                }
                bs.set(l);
                if(dp[a][l]){
                    vvv[i][bs.count()-1][l] = 1;
                }
            }
        }
    }
    rep(i, n){
        rep(j, n){
            bool f = true;
            rep(l, k)f = f && (vvv[l][i][j] == 1);
            if(f){
                cout << "Yes" << endl;
                return 0;
            }
        }
        
    }cout << "No" << endl;

    return 0;
}