import std, core.bitop;
string[] _R;
void readM(T)(ref T x) { while (_R.empty) { _R = readln.chomp.split; } x = _R.front.to!T; _R.popFront; }
bool chmin(T)(ref T A, T B) { if (A > B) { A = B; return true; } else { return false; } }
bool chmax(T)(ref T A, T B) { if (A < B) { A = B; return true; } else { return false; } }
int lowerBound(T)(T[] A, T x) { int lo = -1, hi = cast(int)(A.length); while (hi - lo > 1) { int mid = lo + hi >> 1; (A[mid] < x ? lo : hi) = mid; } return hi; }
int upperBound(T)(T[] A, T x) { int lo = -1, hi = cast(int)(A.length); while (hi - lo > 1) { int mid = lo + hi >> 1; (A[mid] > x ? hi : lo) = mid; } return hi; }

void main() {
	int N, M;
	N.readM;
	M.readM;
	auto C = new int[N];
	foreach (i; 0 .. N) {
		C[i].readM;
	}
	auto G = new int[][](N, 0);
	foreach (i; 0 .. M) {
		int u, v;
		u.readM;
		v.readM;
		--u, --v;
		G[u] ~= v;
		G[v] ~= u;
	}
	int ans;
	auto A = new int[N];
	auto vis = new bool[N];
	foreach (i; 0 .. N) {
		if (!vis[i]) {
			++A[C[i] - 1];
			int[] que;
			que ~= i;
			vis[i] = true;
			while (!que.empty) {
				int u = que.front;
				que.popFront;
				foreach (v; G[u]) {
					if (C[u] == C[v] && !vis[v]) {
						vis[v] = true;
						que ~= v;
					}
				}
			}
		}
	}
	foreach (i; 0 .. N) {
		if (A[i]) {
			ans += A[i] - 1;
		}
	}
	writeln(ans);
}