#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> c(n);
    for (int i = 0; i < n; i++) {
        cin >> c[i];
        c[i]--;
    }
    atcoder::dsu uf(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        if (c[u] == c[v]) {
            uf.merge(u, v);
        }
    }
    vector<long long> cnt(n);
    auto g = uf.groups();
    for (auto v : g) {
        int x = v[0];
        cnt[c[x]]++;
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        ans += max(0LL, cnt[i] - 1);
    }
    cout << ans << endl;
}