#include <bits/stdc++.h> using namespace std; class UnionFind{ public: vector<int> par,siz; void make(int N){ par.resize(N,-1); siz.resize(N,1); } int root(int x){ if(par.at(x) == -1) return x; else return par.at(x) = root(par.at(x)); } void unite(int u, int v){ u = root(u),v = root(v); if(u == v) return; if(siz.at(u) < siz.at(v)) swap(u,v); par.at(v) = u; siz.at(u) += siz.at(v); } bool issame(int u, int v){ if(root(u) == root(v)) return true; else return false; } //ノーマルUnion-Findです UnionbySizeと経路圧縮搭載!. }; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int N,M; cin >> N >> M; UnionFind Z; Z.make(N); vector<int> C(N); vector<vector<int>> rev(N); for(int i=0; i<N; i++){ int c; cin >> c; c--; C.at(i) = c; rev.at(c).push_back(i); } for(int i=0; i<M; i++){ int u,v; cin >> u >> v; u--; v--; if(C.at(u) != C.at(v)) continue; Z.unite(u,v); } int answer = 0; for(int i=0; i<N; i++){ if(rev.at(i).size() == 0) continue; set<int> Vs; for(auto v : rev.at(i)) Vs.insert(Z.root(v)); answer += Vs.size()-1; } cout << answer << endl; }