#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n,m,k;cin>>n>>m>>k;
  vc<int>x(k); rep(i,k)cin>>x[i],x[i]--;
  vc v(n,vc<int>(0));
  rep(i,m){
    int a,b;cin>>a>>b;
    a--;b--;
    v[a].pb(b);v[b].pb(a);
  }
  int t=1<<n;
  vc dp(k,vc<int>(t,0));
  rep(i,k)dp[i][1<<x[i]]=1<<x[i];
  rep(z,n){
    int ans=t-1;
    rep(i,k){
      int now=0;
      rep(j,t)now|=dp[i][j];
      ans&=now;
    }
    if(ans){
      cout<<"Yes";
      return 0;
    }
    vc pre(k,vc<int>(t,0));
    swap(pre,dp);
    rep(i,k)rep(j,t)rep(s,n)if(pre[i][j]>>s&1)for(auto au:v[s])if(~j>>au&1)dp[i][j^1<<au]|=1<<au;
  }
  cout<<"No";
}