#include <bits/stdc++.h>
#define Getchar() p1 == p2 and (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++
char buf[1 << 21], *p1, *p2;
inline int read (void)
{
	int x = 0; char c = Getchar();
	while (c < '0' or c > '9') c = Getchar();
	while (c >= '0' and c <= '9') x = x * 10 + c - 48, c = Getchar();
	return x;
}
const int maxn = 1000000 + 10;
int n, m, col[maxn]; long long Ans, val[maxn], ans[maxn];
int tot, dfn[maxn], low[maxn], times, st[maxn], tp;
std::vector<int> e[maxn], g[maxn];
std::unordered_map<int, int> sum, now, cnt[maxn];
inline void tarjan (int u)
{
	dfn[u] = low[u] = ++times; st[++tp] = u; now[col[u]]++;
	for (int v: e[u])
		if (!dfn[v])
		{
			tarjan(v); low[u] = std::min(low[u], low[v]);
			if (low[v] >= dfn[u])
			{
				auto add = [&] (int u, int v) {g[u].push_back(v); g[v].push_back(u);} ;
				add(u, ++tot);
				do add(st[tp], tot); while (st[tp--] != v) ;
			}
		}
		else low[u] = std::min(low[u], dfn[v]);
}
inline void merge (int u, int v)
{
	ans[u] += val[v];
	if (cnt[u].size() < cnt[v].size()) std::swap(cnt[u], cnt[v]), val[u] = val[v];
	for (auto [c, w]: cnt[v]) val[u] += 1LL * w * (now[c] - 2 * cnt[u][c] - w), ans[u] -= 1LL * w * cnt[u][c], cnt[u][c] += w;
	std::unordered_map<int, int>().swap(cnt[v]);
}
inline void dfs (int u, int fr)
{
	if (u <= n) cnt[u][col[u]]++, ans[u] = val[u] = now[col[u]] - 1;
	for (int v: g[u]) if (v != fr) dfs(v, u), merge(u, v);
}
signed main ()
{
	tot = n = read(); m = read();
	for (int i = 1; i <= n; i++) col[i] = read();
	for (int i = 1, u, v; i <= m; i++) u = read(), v = read(), e[u].push_back(v), e[v].push_back(u);
	for (int i = 1; i <= n; i++) if (!dfn[i])
	{
		std::unordered_map<int, int>().swap(now); tarjan(i); dfs(i, 0);
		for (auto [c, w]: cnt[i]) Ans += 1LL * sum[c] * w, sum[c] += w;
	}
	for (int i = 1; i <= n; i++) printf("%lld\n", ans[i] + Ans);
	return 0;
}