#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)

signed main(){
  int n,m;cin>>n>>m;
  vector<int> visited(n,0);
  int s,g;cin>>s>>g;
  s--;g--;
  visited[s]=1;
  vector<int>edge[n];
  rep(i,m){
    int f,t;cin>>f>>t;
    f--;t--;
    edge[f].push_back(t);
    edge[t].push_back(f);
  }
  int u;
  cin>>u;
  rep(i,u){
    int I;cin>>I;
    I--;
    edge[I].erase(edge[I].begin(),edge[I].end());
  }
  /*rep(i,n){
    for(auto e:edge[i]){
      cout<<e;
    }
    cout<<endl;
  }*/
  queue<int>que;
  que.push(s);
  while(!que.empty()){
    int u=que.front();que.pop();
    visited[u]=1;
    for(auto v:edge[u]){
      //cout<<"#"<<u<<endl;
      if(visited[v]==1) continue;
      que.push(v);
    }
  }
  if(visited[g]==1) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}