#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
using namespace std;
struct dsu {
  dsu(int n) {
    l= vector<int>(n);
    s= vector<int>(n);
    for (int i = 0; i < n; i++) {
      l[i] = i;
      s[i] = 1;
      mp[i] = { i };
    }

  }
  int leader(int v) const {
    return l[v];
  }
  int size(int v) const {
    return s[v];
  }
  bool same(int u, int v) {
    if (leader(u) == leader(v)) return true;
    return false;
  }
  void merge(int u, int v) {
    if (same(u, v)) return;
    if (size(u) > size(v)) {
      swap(v, u);
    }
    int ul = leader(u);
    int vl = leader(v);
    int ns = size(u) + size(v);
    for (auto e : mp[ul]) {
      l[e] = vl;
      mp[vl].push_back(e);
    }
    for (auto e : mp[vl]) {
      s[e] = ns;
    }
  }

  vector<int> l;
  vector<int> s;
  map<int, vector<int>> mp;
};

int main() {
  int n, m; cin >> n >> m;
  vector<int> z(n), c(n), cnt(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
    c[i]--;
    z[i] = cnt[c[i]]++;
  }
  map<int, vector<pair<int, int>>> mp;
  for (int i = 0; i < m; i++) {
    int u, v; cin >> u >> v; u--, v--;
    if (c[u] == c[v]) {
      mp[c[u]].push_back({u, v});
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    int now = 0;
    if (mp[i].size()) {
      dsu d(cnt[i]);
      for (auto [u, v] : mp[i]) {
        int nu = z[u];
        int nv = z[v];
        if (!d.same(nu, nv)) {
          d.merge(nu, nv);
          now++;
        }
      }
    }
    if (cnt[i] > 0) {
      ans += cnt[i] - 1 - now;
    }
  }
  cout << ans << endl;


}