class UnionFind(): def __init__(self,size): self.uf=[[-1,0,1] for i in range(size)] def unite(self,fir,sec): one=self.root(fir) two=self.root(sec) if one!=two: if self.uf[one][1]>self.uf[two][1]: one,two=two,one self.uf[one][0]=two self.uf[two][2]+=self.uf[one][2] if self.uf[one][1]==self.uf[two][1]: self.uf[two][1]+=1 def same(self,fir,sec): return self.root(fir)==self.root(sec) def root(self,node): pos=node change=[] while self.uf[pos][0]!=-1: change.append(pos) pos=self.uf[pos][0] for i in change: self.uf[i][0]=pos return pos def size(self,node): return self.uf[self.root(node)][2] N,M=map(int,input().split()) C=list(map(int,input().split())) union=UnionFind(N) for i in range(M): u,v=map(int,input().split()) if C[u-1]==C[v-1]: union.unite(u-1,v-1) aft=[set() for i in range(N+1)] for i in range(N): aft[C[i]].add(union.root(i)) ans=0 for i in range(N+1): ans+=max(0,len(aft[i])-1) print(ans)