#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define inp(x) for(auto &i:x)cin>>i
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m,s,g,u;cin>>n>>m>>s>>g;
  s--;g--;
  vector<pll> FT(m);
  for(auto &[f,t]:FT)cin>>f>>t;
  cin>>u;
  unordered_set<ll> st;
  rep(i,0,u){
    ll I;cin>>I;
    I--;
    st.insert(I);
  }
  vvl G(n);
  for(auto &[f,t]:FT){
    f--;t--;
    if(st.count(f) || st.count(t))continue;
    G[f].push_back(t);
    G[t].push_back(f);
  }
  vb visited(n,false);
  queue<ll> q;
  q.push(s);
  visited[s] = true;
  while(!q.empty()){
    ll v = q.front();q.pop();
    for(ll nv:G[v]){
      if(visited[nv])continue;
      visited[nv] = true;
      q.push(nv);
    }
  }
  if(visited[g])Yes;
  else No;
}