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

int main() {
  int N, M, Ans = 0; cin >> N >> M;
  vector<int> C(N), Count(N, -1); for (int &A : C) { cin >> A; A--; }
  vector<bool> seen(N);
  vector<vector<int>> G(N);

  for (int i = 0; i < M; i++) {
    int u, v; cin >> u >> v;
    u--; v--;
    if (C.at(u) == C.at(v)) {
      G.at(u).push_back(v);
      G.at(v).push_back(u);
    }
  }

  auto DFS = [&](auto DFS, int x) -> void {
    seen.at(x) = true;
    for (int to : G.at(x))
      if (!seen.at(to)) DFS(DFS, to);
  };

  for (int i = 0; i < N; i++) {
    if (!seen.at(i)) {
      Count.at(C.at(i))++;
      DFS(DFS, i);
    }
  }

  for (int i : Count)
    if (i != -1) Ans += i;
  cout << Ans << endl;
}