from collections import deque

N, M = map(int, input().split())
C = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(M):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    for i in range(M):
        if C[u] == C[v]:
            graph[u].append(v)
            graph[v].append(u)

ans = 0
Clist = [[] for _ in range(N + 1)]
for i in range(N):
    Clist[C[i]].append(i)
isvisited = [False for _ in range(N)]
dq = deque()
for i in range(1, N + 1):
    comp = 0
    for v in Clist[i]:
        if isvisited[v]:
            continue
        comp += 1
        isvisited[v] = True
        dq.append(v)
        while len(dq):
            p = dq.popleft()
            for x in graph[p]:
                if isvisited[x]:
                    continue
                isvisited[x] = True
                dq.append(x)
    ans += max(0, comp - 1)
print(ans)