#ifdef SENJAN
#include <ku/debug.hpp>
#else
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define debug(...)
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using graph=vector<vector<int>>;
template<class T> using wgraph=vector<vector<pair<int,T>>>;
template<class T> using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
constexpr int INF32=INT_MAX/2;
constexpr ll INF64=1LL<<60;
constexpr ld PI=3.14159265358979323846;
constexpr int dx[]={0,0,-1,1,-1,-1,1,1},dy[]={-1,1,0,0,-1,1,-1,1};
#define rep(i,s,n) for(ll i=(ll)(s);i<(ll)(n);i++)
#define rrep(i,s,n) for(ll i=(ll)(s);i>=(ll)(n);i--)
template<class T> inline bool chmax(T &a,T b){return a<b?a=b,true:false;}
template<class T> inline bool chmin(T &a,T b){return a>b?a=b,true:false;}
void _main();
int main(){cin.tie(0)->sync_with_stdio(0);cout<<fixed<<setprecision(16);_main();}

void _main(){
	int N, M; cin >> N >> M;
	vector<int> C(N); rep(i,0,N) cin >> C[i];

	dsu uf(N);
	rep(i,0,M){
		int u, v; cin >> u >> v;
		u--, v--;
		if(C[u]==C[v]) uf.merge(u, v);
	}

	set<int> col;
	rep(i,0,N) col.insert(C[i]);

	auto gr = uf.groups();

	int ans = gr.size() - col.size();
	cout << ans << endl;
}