import sys
input = sys.stdin.readline

N,M=list(map(int,input().split()))
S0,G0=list(map(int,input().split()))
E=[list(map(int,input().split())) for i in range(M)]
U=int(input())
S=set(map(int,input().split()))

# UnionFind

Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

for x,y in E:
    if x in S:
        continue
    if y in S:
        continue
    Union(x,y)

if find(S0)==find(G0):
    print("Yes")
else:
    print("No")