/**
	author:  shobonvip
	created: 2024.10.25 21:26:49
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, k;
	cin >> n >> m >> k;

	vector<int> x(k);
	rep(i,0,k){
		cin >> x[i];
		x[i]--;
	}
	vector<int> f(n+1, (1<<n)-1);
	vector edge(n, vector<bool>(n));
	rep(i,0,m){
		int u, v; cin >> u >> v;
		u--; v--;
		edge[u][v] = 1;
		edge[v][u] = 1;
	}

	rep(num,0,k){
		vector dp(1<<n, vector<bool>(n));
		dp[1<<x[num]][x[num]] = 1;
		vector<int> seen(n+1);
		rep(i,0,1<<n){
			int ppc=__builtin_popcount(i);
			rep(j,0,n){
				if(!(i>>j&1))continue;
				if(!dp[i][j])continue;
				seen[ppc]|=1<<j;			
				rep(k,0,n){
					if(!edge[j][k])continue;
					if(i>>k&1)continue;
					dp[i|(1<<k)][k] = 1;
				}
			}
		}
		rep(i,0,n+1){
			f[i]&=seen[i];
		}
	}
	
	rep(i,0,n+1){
		if(f[i]>0){
			cout<<"Yes\n";
			return 0;
		}
	}
	cout<<"No\n";
	
	
}