//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/dsu>
#include <boost/rational.hpp>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const double pi = 3.14159265359879323846264338327950288419;
const ll INF = 9 * 1e18;
using p = pair<ll, ll>;

int main() {
  int n, m; cin >> n >> m;
  vector<ll> color(n);
  map<int, vector<int>> mp;
  for(int i = 0; i < n; i++){
    cin >> color[i];
    mp[color[i]].push_back(i);
  }
  
  dsu d(n);
  while(m--){
    int u, v; cin >> u >> v;
    u--; v--;
    if(color[u] == color[v]) d.merge(u, v);
  }
  
  ll cnt = 0;
  for(auto [k, v] : mp){
    //cerr << k << " : ";
    for(auto x : v) {
      //cerr << x << " ";
      if(d.same(v[0], x)) continue;
      d.merge(v[0], x);
      cnt++;
    }
    //cerr << endl;
  }
  
  cout << cnt << endl;
}