class UnionFind:
    def __init__(self, n):
        self.par = [-1]*n
        self.rank = [0]*n

    def Find(self, x):
        if self.par[x] < 0:
            return x
        else:
            self.par[x] = self.Find(self.par[x])
            return self.par[x]

    def Unite(self, x, y):
        x = self.Find(x)
        y = self.Find(y)

        if x != y:
            if self.rank[x] < self.rank[y]:
                self.par[y] += self.par[x]
                self.par[x] = y
            else:
                self.par[x] += self.par[y]
                self.par[y] = x
                if self.rank[x] == self.rank[y]:
                    self.rank[x] += 1

    def Same(self, x, y):
        return self.Find(x) == self.Find(y)

    def Size(self, x):
        return -self.par[self.Find(x)]

n, m = map(int, input().split())
s, g = map(int, input().split())
s, g = s-1, g-1
E = []
for i in range(m):
    f, t = map(int, input().split())
    f, t = f-1, t-1
    E.append((f, t))
u = int(input())
I = list(map(int, input().split()))
I = [i-1 for i in I]
I = set(I)
uf = UnionFind(n)
for f, t in E:
    if f not in I and t not in I:
        uf.Unite(f, t)
if uf.Same(s, g):
    print('Yes')
else:
    print('No')