#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ld pi=3.141592653589793;
const int inf=2e9;
const ll linf=2e18;
const ld eps=1e-14;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl

int main() {
    ll n,m;
    cin >> n >> m;
    vector<ll> c(n);
    map<ll,ll> mp;
    for(ll i=0; i<n; i++) {
        cin >> c[i];
        mp[c[i]]++;
    }
    dsu uf(n);
    for(ll i=0; i<m; i++) {
        ll u,v;
        cin >> u >> v;
        u--,v--;
        if(c[u]==c[v]) {
            uf.merge(u,v);
        }
    }
    vector<set<ll>> st(n+1);
    for(ll i=0; i<n; i++) {
        st[c[i]].insert(uf.leader(i));
    }
    ll ans=0;
    for(ll i=0; i<=n; i++) {
        ans+=max((ll)st[i].size()-1LL,0LL);
    }
    cout << ans << endl;
}