#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  VI x(k);
  rep(i, k) cin >> x[i], x[i]--;
  VVI to(n);
  rep(_, m) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    to[u].emplace_back(v);
    to[v].emplace_back(u);
  }
  vector<vector<char>> oks;
  rep(i, n + 1) oks.emplace_back(n, true);
  for (int x : x) {
    vector<array<bool, 15>> dp(1 << n), ndp;
    dp[1 << x][x] = true;
    rep(i, n + 1) {
      rep(u, n) {
        bool found = false;
        rep(s, 1 << n) if (dp[s][u]) {
          found = true;
          break;
        }
        oks[i][u] &= found;
      }
      if (i == n) break;
      ndp.assign(1 << n, {});
      rep(s, 1 << n) rep(u, n) if (dp[s][u]) {
        for (int v : to[u]) if (!(s >> v & 1)) {
          ndp[s | 1 << v][v] = true;
        }
      }
      swap(dp, ndp);
    }
  }
  bool ans = false;
  rep(i, n + 1) rep(u, n) ans |= oks[i][u];
  cout << (ans ? "Yes\n" : "No\n");
}