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

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

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)


N, M = map(int, input().split())
S, G = map(int, input().split())
FT = [tuple(map(int, input().split())) for i in range(M)]
U = int(input())
I = set()
if U:
  I = set(map(int, input().split()))

uf = UnionFind(N + 1)
for f, t in FT:
  if f in I or t in I:
    continue
  uf.union(f, t)

if uf.same(S, G):
  print('Yes')
else:
  print('No')