#include <atcoder/dsu>
#include <iostream>
#include <vector>
using namespace std;
using namespace atcoder;

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> C(N);
    for (int i = 0; i < N; i++) {
        cin >> C[i];
    }
    vector<int> u(M);
    vector<int> v(M);
    for (int i = 0; i < M; i++) {
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    dsu tree(N);
    for (int i = 0; i < M; i++) {
        if (C[u[i]] == C[v[i]]) {
            tree.merge(u[i], v[i]);
        }
    }
    vector<vector<int>> color(N + 1, vector<int>(0));
    for (int i = 0; i < N; i++) {
        color[C[i]].push_back(i);
    }
    int ans = 0;
    for (int i = 0; i <= N; i++) {
        int cols = 0;
        for (int j = 0; j < color[i].size(); j++) {
            if (tree.leader(color[i][j]) == color[i][j]) {
                cols++;
            }
        }
        if (cols >= 2) {
            ans += (cols - 1);
        }
    }
    cout << ans << endl;
}