def solve(s):
    dp = [[False] * (1 << N) for _ in range(N)]
    dp[s][1 << s] = True
    for i in range(1 << N):
        for j in range(N):
            if i >> j & 1 == 0:
                continue
            for k in range(N):
                if i >> k & 1:
                    continue
                dp[k][i | 1 << k] |= dp[j][i] and g[j][k]
    return dp

N, M, K = map(int, input().split())
X = [int(x) - 1 for x in input().split()]
g = [[False] * N for _ in range(N)]
for _ in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    g[u][v] = g[v][u] = True

dp = [[[False] * N for _ in range(N)] for _ in range(N)]
for x in X:
    res = solve(x)
    for i in range(1 << N):
        for j in range(N):
            dp[x][i.bit_count() - 1][j] |= res[j][i]

# i回目にjで合流できるか
for i in range(N):
    for j in range(N):
        if all(dp[x][i][j] for x in X):
            print('Yes')
            exit()
print('No')