n,m,k=map(int,input().split())
x=[*map(lambda a:int(a)-1,input().split())]
g=[[]for _ in range(n)]
for i in range(m):
	u,v=map(int,input().split())
	g[u-1].append(v-1)
	g[v-1].append(u-1)

ans=[[1]*(n+1)for _ in range(n)]
for t in range(k):
	dp=[[[0]*(1<<n) for _ in range(n)]for _ in range(n+1)]
	dp[0][x[t]][1<<x[t]]=1
	for i in range(n):
		for j in range(n):
			ok=0
			for tmp in range(1<<n):
				if not dp[i][j][tmp]:continue
				ok=1
				for k in range(len(g[j])):
					if (tmp>>g[j][k])&1:continue
					dp[i+1][g[j][k]][tmp|(1<<g[j][k])]=1
			if not ok:ans[j][i]=0
	for i in range(n):
		ok=0
		for tmp in range(1<<n):
			if dp[n][i][tmp]:ok=1
		if not ok:ans[i][n]=0
ok=0
for i in range(n):
	for j in range(n):
		if ans[i][j]:ok=1
if ok:print("Yes")
else:print("No")