class UnionFind: def __init__(self, n, w=None): self.par = [-1]*n self.rank = [0]*n self.siz = [1]*n self.cnt = n self.min_node = [i for i in range(n)] self.weight = w if w else [1]*n def root(self, x): if self.par[x] == -1: return x self.par[x] = self.root(self.par[x]) return self.par[x] def issame(self, x, y): return self.root(x) == self.root(y) def unite(self, x, y): px = self.root(x) py = self.root(y) if px == py: return False if self.rank[px] < self.rank[py]: px, py = py, px self.par[py] = px if self.rank[px] == self.rank[py]: self.rank[px] += 1 self.siz[px] += self.siz[py] self.cnt -= 1 self.min_node[px] = min(self.min_node[px], self.min_node[py]) self.weight[px] += self.weight[py] return False def count(self): return self.cnt def min(self, x): return self.min_node[self.root(x)] def getweight(self, x): return self.weight[self.root(x)] def size(self, x): return self.siz[self.root(x)] import itertools import sys input = sys.stdin.readline N, M = map(int, input().split()) IJ = [list(map(int, input().split())) for _ in range(M)] V = list(map(int, input().split())) V = set(V) if N<=2: print("No") exit() for k in range(3, N+1): for l in itertools.combinations(range(N), k): s = set(l) if s==V: continue UF = UnionFind(N) for i, j in IJ: if i in s and j in s: if UF.issame(i, j): if UF.size(i)==k: print("Yes") exit() else: break UF.unite(i, j) print("No")