import sys
sys.setrecursionlimit(10**6)
N,M = map(int,input().split())
C = [0]+list(map(int,input().split()))
T = [[i,0] for i in range(N+1)]
def find(x):
    if T[x][0]==x:return x
    return find(T[x][0])
def union(x,y):
    rx = find(x)
    ry = find(y)
    if rx==ry:return
    if T[ry][1]<T[rx][1]:
        T[ry][0] = rx
    elif T[ry][1]>T[rx][1]:
        T[rx][0] = ry
    else:
        T[ry][0] = rx
        T[rx][1] += 1
D = {}
for _ in range(M):
    a,b = map(int,input().split())
    if C[a]==C[b]:
        union(a,b)
D = {}
for i in range(1,N+1):
    rt = find(i)
    if C[rt] not in D:
        D[C[rt]] = set()
    D[C[rt]].add(rt)
ans = 0
for c in D:
    ans += len(D[c])-1
print(ans)