#include <bits/stdc++.h>
using namespace std;
int R = pow(10, 9) + 7;
template <typename T>
T last(vector<T>& v) {
  return v[v.size() - 1];
}
template <typename T>
void print(vector<T>& v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << ' ';
  }
  cout << endl;
}
template <typename T1, typename T2>
void print(vector<pair<T1, T2>>& v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    cout << '(' << v[i].first << ',' << v[i].second << "),";
  }
  cout << "]" << endl;
}
template <typename T>
void print(vector<vector<T>>& v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    print(v[i]);
  }
  cout << "]" << endl;
}
template <typename T>
void print(set<T>& v) {
  cout << "{";
  for (auto i : v) {
    cout << i << ' ';
  }
  cout << "}" << endl;
}
template <typename T1, typename T2>
void print(map<T1, T2>& v) {
  cout << "{";
  for (auto i : v) {
    cout << i.first << ':' << i.second << ',';
  }
  cout << "}" << endl;
}
template <typename T>
bool in(set<T>& indices, T x) {
  return indices.find(x) != indices.end();
}
template <typename T, typename T_>
bool in(map<T, T_>& indices, T x) {
  return indices.find(x) != indices.end();
}
int power(int x, int y) {
  int res = 1;
  x = x % R;
  if (x == 0) return 0;
  while (y > 0) {
    if (y % 2 == 1) res = (res * x) % R;
    y /= 2;
    x = (x * x) % R;
  }
  return res;
}
bool compare(int a, int b) { return (a < b); }
int ans = 0;
vector<set<int>> indices;
vector<int> parent;
vector<int> set_size;
void make_set(int v) {
  parent[v] = v;
  set_size[v] = 1;
}
int find_set(int v) {
  if (v == parent[v]) return v;
  return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
  a = find_set(a);
  b = find_set(b);
  if (set_size[a] < set_size[b]) swap(a, b);
  parent[b] = a;
  set_size[a] += set_size[b];
  for (int i : indices[b]) {
    if (in(indices[a], i - 1)) ans--;
    if (in(indices[a], i + 1)) ans--;
  }
  for (int i : indices[b]) {
    indices[a].insert(i);
  }
  indices[b].clear();
}
void TestCase() {
  int n, m;
  cin >> n >> m;
  indices.resize(m);
  set_size.resize(m);
  parent.resize(m);
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    x--;
    indices[x].insert(i);
    v[i] = x;
  }
  for (int i = 0; i < m; i++) {
    make_set(i);
  }
  for (int i = 0; i < n - 1; i++) {
    if (v[i] != v[i + 1]) ans++;
  }
  cout << ans << '\n';
  for (int i = 0; i < m - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    union_sets(a, b);
    cout << ans << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T;
  T = 1;
  for (int tt = 1; tt <= T; tt++) {
    TestCase();
  }
}
