class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]


n,m = map(int,input().split())
s,g = [int(x)-1 for x in input().split()]
FT = [[int(x)-1 for x in input().split()] for i in range(m)]
u = int(input())
danger = [0]*n
for i in [int(x)-1 for x in input().split()]:
    danger[i] = 1
uf = Unionfind(n)
for f,t in FT:
    if danger[f] or danger[t]:
        continue
    uf.union(f,t)

print("Yes" if uf.same(s,g) else "No")