#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Unionfind{
  vector<int> par, siz;
  //初期化
  Unionfind(int n) : par(n,-1) , siz(n,1) {}
  int root(int x) {
    if(par[x] == -1) return x;
    else return par[x] = root(par[x]);
  }
  bool issame(int x,int y) {
    return root(x) == root(y);
  }
  bool unite(int x, int y){
    x = root(x); y = root(y);
    if(x ==  y) return false;
    if(siz[x] < siz[y]) swap(x,y);
    par[y] =  x;
    siz[x] += siz[y];
    return true;
  }
  int size(int x) {
    return siz[root(x)];
  }
};
signed main(){
    int N,M,K;
    cin>>N>>M>>K;
    vector<int> S(K);
    for(int i=0;i<K;i++){
    	cin>>S[i];
    	S[i]--;
    }
    vector<vector<int>> G(N);
    for(int i=0;i<M;i++){
    	int a,b;
    	cin>>a>>b;
    	a--;
    	b--;
    	G[a].push_back(b);
    	G[b].push_back(a);
    }
    Unionfind uf(N*N);
    for(int i=0;i<N;i++)for(int j=0;j<N;j++){
    	uf.unite(i*N+j,j*N+i);
    	for(int x:G[i])for(int y:G[j]) uf.unite(i*N+j,x*N+y);
    }
    for(int i=0;i<K;i++)for(int j=0;j<K;j++){
    	if(!uf.issame(S[i],S[j])){
    		cout<<"No"<<endl;
    		return 0;
    	}
    	bool ok = false;
    	for(int k=0;k<N;k++)if(uf.issame(k*N+k,S[i]*N+S[j])) ok = true;
    	if(!ok){
    		cout<<"No"<<endl;
    		return 0;
    	}
    }
    cout<<"Yes"<<endl;
}