from collections import defaultdict

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)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n,m = map(int,input().split())
s,g = map(int,input().split())
ab = []
for i in range(m):
    z,x = map(int,input().split())
    ab.append([z,x])
u = int(input())
p = set(list(map(int,input().split())))
q = []
for i in range(m):
    if (ab[i][0] not in p) and (ab[i][1] not in p):
        q.append(ab[i])
P = UnionFind(n)
for i in range(len(q)):
    P.union(q[i][0]-1,q[i][1] - 1)
#print(s - 1,g - 1)
if P.same(s - 1,g - 1):
    print("Yes")
else:
    print("No")
#print(P)