Problem Statement

You are given a simple undirected graph with $N$ vertices and $M$ edges, whose vertices are numbered from $1$ to $N$ and whose edges are numbered from $1$ to $M$.
The $i$-th edge $(1 \leq i \leq M)$ connects vertex $u_i$ and vertex $v_i$.
Also, the $i$-th vertex $(1 \leq i \leq N)$ is painted with color $C_i $.

Kushira-kun can perform the following operation on this graph $0$ or more times.

• Choose a pair of integers $(a,b)$ satisfying $1 \leq a,b \leq N $, and add an edge connecting vertex $a$ and vertex $b$.

Kushira-kun's goal is to perform operations so that this graph satisfies the following condition.

• For every pair of vertices $(i, j)$ with $C_i = C_j$, vertex $j$ can be reached from vertex $i$ by traversing only vertices of color $C_i$.

Constraints

• $ 1 \leq N \leq 2×10^5$
• $ 0 \leq M \leq \mathrm{min} (2×10^5, N(N-1)/2)$
• $ 1 \leq C_i \leq N$
• $ 1 \leq u_i, v_i \leq N $
• $ u_i \neq v_i $
• $ i≠j \Rightarrow \{u_i, v_i\} \neq \{u_j, v_j\} $
• All inputs are integers

Input

$N\ M$
$C_1\ C_2\ \ldots\ C_N$
$u_1\ v_1$
$u_2\ v_2$
$\vdots$
$u_M\ v_M$

Output

Output the answer.

Sample

Sample 1

Input

5 6
1 2 2 2 1
1 2
1 3
1 4
3 4
4 5
2 5

Output

2

It suffices to add edges between vertices $1-5$ and between vertices $2-3$.

4 2
1 1 2 4
1 2
1 3

0

8 9
1 8 1 2 1 3 3 2
6 3
3 2
4 3
5 7
7 3
2 7
2 1
1 4
4 7

4