#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

vector<int> E[2010];

int main() {
  int N, M;
  cin >> N >> M;
  int S, G;
  cin >> S >> G;

  for (int i = 0; i < M; ++i) {
    int f, t;
    cin >> f >> t;
    E[f].push_back(t);
    E[t].push_back(f);
  }

  int U;
  cin >> U;
  vector<bool> visited(N + 1, false);
  for (int i = 0; i < U; ++i) {
    int u;
    cin >> u;
    visited[u] = true;
  }

  queue<int> que;
  que.push(S);

  while (not que.empty()) {
    int v = que.front();
    que.pop();

    if (visited[v]) continue;
    visited[v] = true;

    if (v == G) {
      cout << "Yes" << endl;
      return 0;
    }

    for (int u : E[v]) {
      que.push(u);
    }
  }

  cout << "No" << endl;

  return 0;
}