import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
3 2 2
1 3
1 2
2 3
5 5 4
2 2 2 2
1 2
2 4
3 5
4 5
1 5
4 4 2
1 2
1 2
2 3
3 4
1 4
"""

def Popcount(n):
    c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)
    return c

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M,K=map(int, input().split())
  X=list(map(lambda x:int(x)-1, input().split()))
  G=[[] for _ in range(N)]
  for _ in range(M):
    A,B=map(int, input().split())
    G[A-1].append(B-1)
    G[B-1].append(A-1)
  C=[0]*K*(2**N)*N
  def idx(i,j,k):
    return i*(2**N)*N+j*N+k
  for i in range(K):
    C[idx(i,1<<X[i],X[i])]=1
    for j in range(1<<N):
      for k in range(N):
        if j&(1<<k):
          for l in G[k]:
            # if i==0 and j==5 and k==2: print(i,j^(1<<k),l,k,C[idx(i,j,k)],C[idx(i,j^(1<<k),l)])
            if j&(1<<l) and C[idx(i,j^(1<<k),l)]==1:
              C[idx(i,j,k)]=1
  # for i in range(K):
  #   print(C[i*(2**N)*N:(i+1)*(2**N)*N])
  ans=[0]*K*(N+1)*N
  for i in range(K):
    for j in range(1<<N):
      for k in range(N):
        if C[idx(i,j,k)]==1:
          # print(i,j,k,i*(N+1)*N+Popcount(j)*N+k,Popcount(j),K*N**2)
          ans[i*(N+1)*N+Popcount(j)*N+k]=1
  # for i in range(K):
  #   print(*ans[i*(N+1)*N:(i+1)*(N+1)*N])
  ans2='No'
  for i in range(N*(N+1)):
    j,k=divmod(i,N)
    if all(ans[l*(N+1)*N+j*N+k]==1 for l in range(K)):
      ans2='Yes'
      break
  print(ans2)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)