#include <bits/stdc++.h>
#include <atcoder/all>
using ll = long long;
#define MOD 1000000007
#define Mod 998244353
const int MAX = 1000000005;
const long long INF = 1000000000000000005LL;
using namespace std;
using namespace atcoder;



int main() {
    ios::sync_with_stdio(0);cin.tie();
    int N, M;
    cin >> N >> M;
    vector<int> C(N);
    for (int i = 0; i < N; i++) {cin >> C[i]; C[i]--;}
    vector<vector<int>> G(N);
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        if (C[u] != C[v]) continue;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vector<bool> visited(N);
    vector<set<int>> S(N);
    for (int i = 0; i < N; i++) S[C[i]].insert(i);
    ll ans = 0;
    for (int i = 0; i < N; i++) {
        if (visited[i]) continue;
        queue<int> que;
        que.push(i);
        while (que.size()) {
            int v = que.front();
            que.pop();
            S[C[v]].erase(v);
            visited[v] = true;
            for (auto &nv : G[v]) {
                if (!visited[nv]) que.push(nv);
            }
            if (que.size() == 0 && S[C[v]].size() > 0) {
                que.push(*S[C[v]].begin());
                ans++;
            }
        }
    }
    cout << ans << endl;
}