// 

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> c(n);
	rep(i, n) {
		cin >> c[i];
		c[i]--;
	}
	vector<vector<int>> g(n);
	rep(i, m) {
		int ui, vi;
		cin >> ui >> vi;
		--ui; --vi;
		g[ui].push_back(vi);
		g[vi].push_back(ui);
	}
	vector<vector<int>> clst(n);
	rep(i, n) clst[c[i]].push_back(i);
	int res = 0;
	vector<bool> visited(n);
	rep(i, n) if (!clst[i].empty()) {
		int cnt = 0;
		for (const int& si : clst[i]) if (!visited[si]) {
			++cnt;
			queue<int> que;
			visited[si] = true;
			que.push(si);
			while (!que.empty()) {
				int vi = que.front(); que.pop();
				for (const int& ti : g[vi]) if (c[ti] == c[vi] && !visited[ti]) {
					visited[ti] = true;
					que.push(ti);
				}
			}
		}
		res += cnt - 1;
	}
	cout << res << endl;
	return 0;
}