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())
    G[u-1].append(v-1)
    G[v-1].append(u-1)

def DP(start):
    dp = [[False]*N for _ in range(1<<N)]
    dp[1<<start][start] = True
    move = [0]*N
    for i in range(1<<N):
        for j in range(N):
            if not dp[i][j]:
                continue
            move[i.bit_count()-1] |= 1<<j
            for v in G[j]:
                if 1<<j & i and not 1<<v & i:
                    dp[i|1<<v][v] = True
    return move

ans = [(1<<N)-1]*N
for x in X:
    move = DP(x-1)
    for i in range(N):
        ans[i] &= move[i]

print("Yes" if max(ans) >= 1 else "No")