from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from functools import cmp_to_key, cache
from more_itertools import distinct_permutations
from heapq import heappop, heappush
import math, sys
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**7)
_int = lambda x: int(x)-1
MOD = 998244353
INF = 1<<62
Yes, No = "Yes", "No"

N, M = map(int, input().split())
E = defaultdict(list)
for _ in range(M):
    u, v = map(int, input().split())
    E[u].append(v)
    E[v].append(u)

S = set(list(map(int, input().split())))
stack = []
memo = [0]*N
def dfs(i, parent):
    for j in E[i]:
        if j == parent: continue
        stack.append(j)
        if memo[j]:
            end = stack[-1]
            T = set(stack[stack.index(end):])
            print(Yes if T != S else No)
            exit()
        memo[j] = 1
        dfs(j, i)
        memo[j] = 0
        stack.pop()
stack.append(0)
memo[0] = 1
dfs(0, -1)