class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]
    
def non_rec_dfs(s, ans):
    stack = []
    stack.append(~s)
    stack.append(s)
    par = [-1] * N
    while stack:
        u = stack.pop()
        seen[u] = 1
        if u >= 0:
            stack.append(~u)
            for v in G[u]:
                if v == par[u]:
                    continue
                par[v] = u
                stack.append(v)
        else:
            u = ~u
            if D[u] == 1 and par[u] != -1:
                D[u] = 0
                D[par[u]] = 1 - D[par[u]]
                ans += 1
    return ans

# https://qiita.com/zawawahoge/items/8bbd4c2319e7f7746266
def popcount(x):
    '''xの立っているビット数をカウントする関数
    (xは64bit整数)'''

    # 2bitごとの組に分け、立っているビット数を2bitで表現する
    x = x - ((x >> 1) & 0x5555555555555555)

    # 4bit整数に 上位2bit + 下位2bit を計算した値を入れる
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)

    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f # 8bitごと
    x = x + (x >> 8) # 16bitごと
    x = x + (x >> 16) # 32bitごと
    x = x + (x >> 32) # 64bitごと = 全部の合計
    return x & 0x0000007f

N, M = map(int, input().split())
G = [[] for i in range(N)]
A, B = [], []
U = UnionFind(N)
for i in range(M):
    a, b = map(int, input().split())
    a, b = a - 1, b - 1
    if U.is_same(a, b):
        A.append(a)
        B.append(b)
    else:
        G[a].append(b)
        G[b].append(a)
        U.union(a, b)
C = list(map(int, input().split()))
N2 = len(A)
inf = 10 ** 18
ans = inf
for s in range(1 << N2):
    D = [0] * N
    val = popcount(s)
    if val > ans:
        continue
    for i in range(N):
        D[i] = C[i]
    for i in range(N2):
        if (s >> i) & 1:
            D[A[i]] = 1 - D[A[i]]
            D[B[i]] = 1 - D[B[i]]
    seen = [0] * N
    for i in range(N):
        if seen[i]:
            continue
        val = non_rec_dfs(i, val)
        if val > ans:
            continue
    if sum(D) == 0:
        ans = min(ans, val)
        
print(ans) if ans != inf else print(-1)