class UnionFind: def __init__(self,n): self.n = n self.parent_size = [-1]*n def leader(self,a): if self.parent_size[a] < 0: return a self.parent_size[a] = self.leader(self.parent_size[a]) return self.parent_size[a] def merge(self,a,b): x, y = self.leader(a), self.leader(b) if x == y: return if abs(self.parent_size[x]) < abs(self.parent_size[y]): x, y = y, x self.parent_size[x] += self.parent_size[y] self.parent_size[y] = x return def same(self,a,b): return self.leader(a) == self.leader(b) def size(self,a): return abs(self.parent_size[self.leader(a)]) def groups(self): result = [[] for _ in range(self.n)] for i in range(self.n): result[self.leader(i)].append(i) return [r for r in result if r != []] N, M = map(int, input().split()) C = list(map(int, input().split())) edge = [list(map(int, input().split())) for _ in range(M)] UF = UnionFind(N) for u, v in edge: u, v = u-1, v-1 if C[u] == C[v]: UF.merge(u, v) D = dict() for i in range(N): if UF.leader(i) != i: continue color = C[i] if color in D: D[color] += 1 else: D[color] = 1 ans = 0 for c in D.values(): ans += c-1 print(ans)