import collections import heapq import collections import heapq class Dijkstra: def __init__(self): self.e = collections.defaultdict(list) def add(self, u, v, d): self.e[u].append([v, d]) self.e[v].append([u, d]) def delete(self, u, v): self.e[u] = [_ for _ in self.e[u] if _[0] != v] self.e[v] = [_ for _ in self.e[v] if _[0] != u] def search(self, s): """ :param s: 始点 :return: 始点から各点までの最短経路 """ d = collections.defaultdict(lambda: float('inf')) d[s] = 0 q = [] heapq.heappush(q, (0, s)) v = collections.defaultdict(bool) while len(q): k, u = heapq.heappop(q) if v[u]: continue v[u] = True for uv, ud in self.e[u]: if v[uv]: continue vd = k + ud if d[uv] > vd: d[uv] = vd heapq.heappush(q, (vd, uv)) return d N,M = map(int,input().split()) s,g = map(int,input().split()) FT = [list(map(int, input().split())) for _ in range(M)] G = Dijkstra() U = int(input()) I = set() try: I = set(list(map(int, input().split()))) except Exception as e: pass for f,t in FT: if (not f in I) and (not t in I): G.add(f,t,1) D = G.search(s) if D[g]<10**6: print('Yes') else: print('No')