N,M=map(int, input().split())
C=list(map(int, input().split()))
par=[i for i in range(N)]
rank=[0]*(N)
friend=[0]*N
block=[0]*N
size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
 
for i in range(M):
  a,b=map(int,input().split())
  a-=1;b-=1
  if C[a]==C[b]:
    union(a,b)
    
ans=0
D={};E={}
for i in range(N):
  d=find(i)
  if d not in D:
    D[d]=1
    c=C[i]
    if c not in E:
      E[c]=0
    E[c]+=1

for e in E:
  ans+=E[e]-1
print(ans)