import sys
sys.setrecursionlimit(100000)

n,m,k=map(int,input().split())
x=0
for i in map(int,input().split()):x|=1<<(int(i)-1)
con=[[] for _ in range(n)]

for i in range(m):
	u,v=map(int,input().split())
	con[u-1].append(v-1)
	con[v-1].append(u-1)

possible=[0]*(1<<n)
visited=0

def dfs(now):
	global visited
	possible[visited]^=1<<now
	visited^=1<<now
	for nex in con[now]:
		if not (visited>>nex)&1:
			dfs(nex)
	visited^=1<<now

for i in range(n):
	dfs(i)
	for j in possible:
		#print(format(j,'06b'))
		if j|x==j:
			print("Yes")
			exit()
	possible=[0]*(1<<n)
print("No")