#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
  ll n,m;
  cin>>n>>m;
  vector<ll> c(n);
  for(ll i=0;i<n;i++){
    cin>>c[i];
    c[i]--;
  }
  vector<vector<ll>> G(n);
  for(ll i=0;i<m;i++){
    ll u,v;
    cin>>u>>v;
    u--;
    v--;
    if(c[u]==c[v]){
      G[u].push_back(v);
      G[v].push_back(u);
    }
  }
  vector<bool> seen(n,false);
  queue<ll> que;
  vector<vector<ll>> vec;
  ll id=0;
  for(ll i=0;i<n;i++){
    if(!seen[i]){
      seen[i]=true;
      que.push(i);
      id++;
      vec.resize(id);
      while(que.size()){
        ll q=que.front();
        que.pop();
        vec[id-1].push_back(q);
        for(ll u:G[q]){
          if(!seen[u]){
            seen[u]=true;
            que.push(u);
          }
        }
      }
    }
  }
  vector<ll> cnt(n,0);
  for(ll i=0;i<id;i++){
    cnt[c[vec[i][0]]]++;
  }
  ll ans=0;
  for(ll i=0;i<n;i++){
    ans+=max((ll)0,cnt[i]-1);
  }
  cout<<ans<<endl;
}