#include <bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 1000000007;
//const ll mod = 998244353;
int n, m, c[200009], u[200009], v[200009];
set<int>S[200009];
int main() {
	cin >> n >> m;
	dsu UF(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> c[i];
		S[c[i]].insert(i);
	}
	for (int i = 1; i <= m; i++) {
		cin >> u[i] >> v[i];
		if(c[u[i]]==c[v[i]])UF.merge(u[i], v[i]);
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		ll cnt = 0, par = 0;
		for (auto& s : S[i]) {
			cnt++;
			if (cnt == 1) {
				par = s;
				continue;
			}
			if (UF.same(par, s) == false) {
				ans++;
				UF.merge(par, s);
			}
		}
	}
	cout << ans << endl;
}