#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    int s,g; cin >> s >> g;
    vector<int> x(m),y(m);
    for(int i=0;i<m;i++){
        cin >> x[i] >> y[i];
        x[i]--; y[i]--;
    }
    s--; g--;
    vector<int> ng(n);
    int u; cin >> u;
    for(int i=0;i<u;i++){
        int x; cin >> x;
        x--; ng[x] = 1;
    }
    vector<int> d(n,-1);
    d[s] = 0;
    queue<int> q; q.push(s);
    vector<vector<int>> gg(n);
    for(int i=0;i<m;i++){
        if(!ng[x[i]] and !ng[y[i]]){
            gg[x[i]].push_back(y[i]);
            gg[y[i]].push_back(x[i]);
        }
    }
    while(q.size()){
        int ss = q.front(); q.pop();
        for(int t:gg[ss]){
            if(d[t] == -1){
                d[t] = d[ss]+1;
                q.push(t);
            }
        }
    }
    if(d[g] == -1){
        cout << "No" << endl;
    }
    else{
        cout << "Yes" << endl;
    }
}