N,M,K=map(int, input().split())
X=list(map(int, input().split()))
if len(set(X))==1:
  print('Yes')
  exit()
  
D=[[] for i in range(N)]
for i in range(M):
  u,v=map(int, input().split())
  u-=1;v-=1
  D[u].append(v);D[v].append(u)
from collections import deque
d=deque()
ans=[(1<<(N+2))-1]*N
for i in range(K):
  now=X[i]-1
  d=deque()
  V=[0]*N 
  V[now]+=1 
  d.append((now,1<<now))
  for j in range(N):
    nd=deque()
    while d:
      now,p=d.popleft()
      for nex in D[now]:
        if not p&(1<<nex):          
          pp=p^(1<<nex)
          #V[nex]^=(1<<(j+1))
          nd.append((nex,pp))
    DD={}
    while nd:
      p,q=nd.popleft()
      if (p,q) not in D:
        DD[(p,q)]=1
        V[p]|=1<<(j+1)
        d.append((p,q))
  for j in range(N):
    ans[j]&=V[j]
if max(ans)==0:
  print('No')
else:
  print('Yes')