from collections import deque

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

for i in range(N):G[i].sort()

group = [0 for _ in range(Cnum)]
seen = [False for _ in range(N)]

for i in range(N):
    if seen[i]:continue
    deq = deque([])
    deq.append(i)
    while deq:
        v = deq.popleft()
        seen[v] = True
        for nv in G[v]:
            if C[v]==C[nv] and not seen[nv]:
                deq.append(nv)
    group[C[i]] += 1

for i in range(Cnum):
    if group[i] > 0:group[i] -= 1
ans = sum(group)
print(ans)