import sys
input = sys.stdin.readline

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]


N, M = map(int, input().split())
C = list(map(int, input().split()))
D = [[] for i in range(N)]
for i in range(N):
    D[C[i] - 1].append(i)
    
U = UnionFind(N)
for i in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    if C[u] == C[v]:
        U.union(u, v)
    
ans = 0
for i in range(N):
    S = set()
    if len(D[i]) == 0:
        continue
    for d in D[i]:
        S.add(U.find(d))
    ans += len(S) - 1
    
print(ans)