#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int MOD = 998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, l, r) for (int i = (l); i < (int)(r); i++)
#define all(v) v.begin(), v.end()
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M,K;
  cin>>N>>M>>K;
  vector G(N,vector(N,0));
  vector X(K,0);
  for(int &i:X)cin>>i,--i;
  rep(i,M){
    int U,V;
    cin>>U>>V;
    --U,--V;
    G[U][V]=1;
    G[V][U]=1;
  }
  vector dp(1<<N,vector(N,vector(N,false)));
  rep(i,N){
    dp[1<<i][i][i]=1;
  }
  rep(s,1<<N){
    rep(i,N){
      if(!(s>>i&1))continue;
      rep(v1,N){
        if(!dp[s][i][v1])continue;
        rep(v2,N){
          if(!G[v1][v2])continue;
          if(s>>v2&1)continue;
          dp[s|(1<<v2)][i][v2]=1;
        }
      }
    }
  }
  vector ok(N,vector(N,vector(N,false)));
  rep(s,1<<N){
    rep(i,N){
      rep(j,N){
        if(dp[s][i][j]){
          ok[i][j][__builtin_popcount(s)]=1;
        }
      }
    }
  }
  bool yes=0;
  rep(i,N){
    rep(j,N){
      bool now=1;
      for(int k:X){
        if(!ok[k][i][j])now=0;
      }
      if(now)yes=1;
    }
  }
  cout<<(yes?"Yes\n":"No\n");
}