# include <cstdio>
# include <iostream>
# include <cmath>
# include <algorithm>
# include <cstring>
# include <stack>
# include <queue>
using namespace std;
const int MAXN = 1e6 + 10;
int n, m, a[MAXN], sz[MAXN], son[MAXN], dep[MAXN];
vector <pair <int, int> > vec[MAXN];
vector <int> ts[MAXN];
int Clock = 0, dfn[MAXN], low[MAXN], vis[MAXN], root, ans[MAXN], u[MAXN], v[MAXN], cnt[MAXN];
void tarjan(int nod, int fa) {
	low[nod] = dfn[nod] = ++ Clock;
	vis[nod] = true;
	for (int i = 0; i < vec[nod].size(); i++) cnt[vec[nod][i].first]++;
	for (int i = 0; i < vec[nod].size(); i++) {
		int to = vec[nod][i].first, id = vec[nod][i].second;
		if (!vis[to]) {
			tarjan(to, nod);
			low[nod] = min(low[nod], low[to]);
			if (low[to] > dfn[nod] && cnt[to] < 2) ans[id] = 1;
		} else if (to != fa && dfn[nod] > dfn[to]) low[nod] = min(low[nod], dfn[to]);
	}
	for (int i = 0; i < vec[nod].size(); i++) cnt[vec[nod][i].first]--;
}
int t[MAXN], c[MAXN], p, ans_t[MAXN], ans_nt[MAXN], rt[MAXN];
void add(int x) {
	t[c[x]]--;
	t[++c[x]]++;
	p = max(p, c[x]);
}
void del(int x) {
	t[c[x]]--;
	t[--c[x]]++;
	if (!t[p]) p--;
}
void dfs(int nod, int fa) {
	// cout << nod << " " << fa << endl ;
	if (fa) rt[nod] = rt[fa];
	else rt[nod] = nod;
	add(a[nod]);
	dep[nod] = dep[fa] + 1;
	sz[nod] = 1;
	vis[nod] = 1;
	for (auto p : vec[nod]) {
		int to = p.first, id = p.second;
		if (to == fa || vis[to]) continue;
		dfs(to, nod);
		sz[nod] += sz[to];
		ts[nod].push_back(to);
		if (sz[to] > sz[son[nod]]) son[nod] = to;
	}
}
void subtree(int nod, int type) {
	if (type == -1) del(a[nod]);
	else add(a[nod]);
	for (int i : ts[nod]) subtree(i, type);
}
void dfs2(int nod) {
	vector <int> v;
	for (int i = nod; i; i = son[i]) v.push_back(i);
	for (int i = v.size() - 1; i >= 0; i--) {
		int nod = v[i];
		del(a[nod]);
		for (int j : ts[nod]) {
			if (j != son[nod]) subtree(j, -1);
		}
		ans_nt[nod] = p;
	}
	subtree(nod, 1);
	for (int to : v) {
		for (int s : ts[to]) if (s != son[to]) dfs2(s);
	}
}
void dfs3(int nod) {
	vector <int> v;
	for (int i = nod; i; i = son[i]) v.push_back(i);
	for (int i = v.size() - 1; i >= 0; i--) {
		int nod = v[i];
		add(a[nod]);
		for (int j : ts[nod]) {
			if (j != son[nod]) subtree(j, 1);
		}
		ans_t[nod] = p;
	}
	subtree(nod, -1);
	for (int to : v) {
		for (int s : ts[to]) if (s != son[to]) dfs3(s);
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	//n = m = 1e6;
	for (int i = 1; i <= n; i++) cin >> a[i];//a[i] = rand() % 100;
	for (int i = 1; i <= m; i++) {
		int from, to;
		cin >> from >> to;
		//from = rand() % n + 1, to = rand() % n + 1;
		u[i] = from;
		v[i] = to;
		vec[from].push_back({to, i});
		vec[to].push_back({from, i});
	}
	for (int i = 1; i <= n; i++) if (!vis[i]) {
		root = i;
		tarjan(i, i);
	}
	//return 0;
	memset(vis, 0, sizeof vis);
	int tans = 0;
	for (int i = 1; i <= n; i++) {
		if (vis[i]) continue;
		// cout << "erfwer\n" ;
		dfs(i, 0);
		dfs2(i);
		subtree(i, -1);
		dfs3(i);
		tans += ans_t[i];
	}
	// cout << tans << endl ;
	for (int i = 1; i <= m; i++) {
		if (!ans[i]) cout << tans << " " ;
		else {
			if (dep[u[i]] > dep[v[i]]) swap(u[i], v[i]);
			cout << tans - ans_t[rt[u[i]]] + ans_t[v[i]] + ans_nt[v[i]] << " " ;
		}
	}
	cout << endl ;
	return 0;
}