import sys
input = sys.stdin.readline
N,M = map(int,input().split())
C = list(map(int,input().split()))
UV = [tuple(map(int,input().split())) for _ in range(M)]

vs = [[] for _ in range(N+1)]
for i,c in enumerate(C):
    vs[c].append(i)

es = [[] for _ in range(N+1)]
for u,v in UV:
    u,v = u-1,v-1
    if C[u] != C[v]: continue
    es[C[u]].append((u,v))

class UnionFind:
    def __init__(self,N):
        self.parent = [i for i in range(N)]
        self._size = [1] * N
        self.count = 0
    def root(self,a):
        if self.parent[a] == a:
            return a
        else:
            self.parent[a] = self.root(self.parent[a])
            return self.parent[a]
    def is_same(self,a,b):
        return self.root(a) == self.root(b)
    def unite(self,a,b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb: return
        if self._size[ra] < self._size[rb]: ra,rb = rb,ra
        self._size[ra] += self._size[rb]
        self.parent[rb] = ra
        self.count += 1
    def size(self,a):
        return self._size[self.root(a)]

ans = 0
for c in range(N+1):
    if not vs[c]: continue
    ss = sorted(set(vs[c]))
    ds = {a:i for i,a in enumerate(ss)}
    uf = UnionFind(len(ss))
    for u,v in es[c]:
        i,j = ds[u],ds[v]
        uf.unite(i,j)
    rs = set()
    for i in range(len(ss)):
        rs.add(uf.root(i))
    ans += len(rs) - 1
print(ans)