class Input_kyopro:
    def II(self): return int(input())
    def MI(self): return map(int,input().split())
    def MS(self): return map(str,input().split())
    def LMI(self): return list(self.MI())
    def LMS(self): return list(self.MS())
    def LLI(self,N): return [self.LMI() for _ in range(N)]
    def LLS(self,N): return [self.LMS() for _ in range(N)]
    def LS(self,N): return [input() for _ in range(N)]
    def LSL(self,N): return [list(input()) for _ in range(N)]
    def LI(self,N): return [self.II() for _ in range(N)]
I=Input_kyopro()
#入力
class unionfind:
    def __init__(self,N):
        self.par=[-1]*(N+1)
        self.siz=[1]*(N+1)
        self.max_siz=1
        self.group=N
    def root(self,x):
        while True:
            if self.par[x]==-1:
                break
            x=self.par[x]
        return x
    def unite(self,u,v):
        RootU=self.root(u)
        RootV=self.root(v)
        if RootU==RootV:
            return
        self.group-=1
        if self.siz[RootU]<self.siz[RootV]:
            self.par[RootU]=RootV
            self.siz[RootV]=self.siz[RootU]+self.siz[RootV]
            self.max_siz=max(self.max_siz,self.siz[RootV])
        else:
            self.par[RootV]=RootU
            self.siz[RootU]=self.siz[RootU]+self.siz[RootV]
            self.max_siz=max(self.max_siz,self.siz[RootV])
    def same(self,u,v):
        if self.root(u)==self.root(v):
            return True
        else:
            return False
    def Max_size(self):
        return self.max_siz
    def group_count(self):
        return self.group
    def get_roots(self):
        return set(self.par)-{-1}
    def get_size(self,x):
        return self.siz[self.root(x)]
N,M=I.MI()
C=I.LMI()
uv=I.LLI(M)
uf=[unionfind(N) for _ in range(N)]
count=[0]*N
for i in range(N):
    count[C[i]-1]+=1
for u,v in uv:
    u-=1
    v-=1
    if C[u]==C[v]:
        uf[C[u]-1].unite(u,v)
ans=0
for i in range(N):
    if uf[i].group_count()-(N-count[i])>=1:
        ans+=uf[i].group_count()-(N-count[i])-1
print(ans)