from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) def main(): N,M = map(int,input().split()) C = list(map(int,input().split())) C_dict = defaultdict(list) assert 1 <= N <= 2*10**5 assert 1 <= M <= min(2*10**5, N*(N-1)//2) for i,c in enumerate(C): assert 1 <= c <= N C_dict[c].append(i) uv_set = set() uf = UnionFind(N) for _ in [0]*M: u,v = map(int,input().split()) assert u != v assert (u,v) not in uv_set assert (v,u) not in uv_set assert 1 <= u <= N assert 1 <= v <= N uv_set.add((u,v)) if C[u-1] == C[v-1]: uf.union(u-1,v-1) # print(C_dict) # print(uf) ans = 0 for c in C_dict: set_per_c = set() for i in C_dict[c]: set_per_c.add(uf.find(i)) ans += len(set_per_c)-1 print(ans) if __name__ == "__main__": main()