N,M,K = map(int,input().split())
X = list(map(int,input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
    u,v = map(int,input().split())
    u -= 1
    v -= 1
    G[u].append(v)
    G[v].append(u)

dp = [[[0] * N for _ in range(1 << N)] for _ in range(N)]
for i in range(N):
    dp[i][1 << i][i] = 1
for n in range(N):
    l = dp[n]

    for bit in range(1,1 << N):
        for i in range(N):
            if bit >> i & 1 == 0 or l[bit][i] == 0:continue
            for v in G[i]:
                if bit >> v & 1 == 0:
                    l[bit | (1 << v)][v] = l[bit][i] + 1
import sys

#print(dp)
for i in range(N):
    f = False
    for d in range(1,N + 1):
        flag = True
        for x in X:
            x -= 1
            ff = False
            for bit in range(1 << N):
                if dp[x][bit][i] == d:
                    ff = True
                    break
            if ff == False:
                flag = False
                break
        if flag:
            f = True
            break
    if f:
        print('Yes')
        exit()
print('No')