#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int c[1000005];
int zsl[1000005];
vector<int>v[1000005];
int tmp;
int sta[1000005],ttop;
int dfn[1000005],low[1000005],cnt;
void tarjan(int x,int f)
{
	dfn[x]=++cnt;
	low[x]=dfn[x];
	sta[++ttop]=x;
	bool flag=false;
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f)continue;
		if(dfn[v[x][i]]==0)
		{
			flag=true;
			tarjan(v[x][i],x);
			low[x]=min(low[x],low[v[x][i]]);
			if(low[v[x][i]]>=dfn[x])
			{
				++tmp;
				while(1)
				{
					v[tmp].push_back(sta[ttop]);
					if(sta[ttop]==v[x][i])
					{
						ttop--;
						break;
					}
					ttop--;
				}
				v[tmp].push_back(x);
			}
		}
		else low[x]=min(low[x],dfn[v[x][i]]);
	}
}
int zs[1000005],zsw[1000005];
int siz[1000005],son[1000005],fa[1000005];
void dfs1(int x,int f)
{
	//printf("%d %d\n",x,f);
	siz[x]=1;
	fa[x]=f;
	int maxn=-1;
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f)continue;
		dfs1(v[x][i],x);
		siz[x]+=siz[v[x][i]];
		if(siz[v[x][i]]>maxn)
		{
			maxn=siz[v[x][i]];
			son[x]=v[x][i];
		}
	}
}
int nsl[1000005],ans,n;
void change(int x,int f,int opt)
{
	if(x<=n)
	{
		//printf("???%d %d %d\n",x,c[x],nsl[c[x]]);
		if(opt==1)
		{
			ans+=nsl[c[x]];
			nsl[c[x]]++;
		}
		else if(opt==2)
		{
			nsl[c[x]]--;
			ans-=nsl[c[x]];
		}
	}
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f)continue;
		change(v[x][i],x,opt);
	}
}
bool vis[1000005];
void dfszs(int x,int f)
{
	//printf("%d %d\n",x,f);
	vis[x]=true;
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f||v[x][i]==son[x])continue;
		dfszs(v[x][i],x);
		change(v[x][i],x,2);
	}
	if(son[x]!=0)dfszs(son[x],x);
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f||v[x][i]==son[x])continue;
		change(v[x][i],x,1);
	}
	if(x<=n)
	{
		ans+=nsl[c[x]];
		nsl[c[x]]++;
	}
	zs[x]=ans;
}
void dfszsw(int x,int f)
{
	vis[x]=true;
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f||v[x][i]==son[x])continue;
		dfszsw(v[x][i],x);
		change(v[x][i],x,1);
	}
	if(son[x]!=0)dfszsw(son[x],x);
	for(int i=0;i<v[x].size();i++)
	{
		if(v[x][i]==f||v[x][i]==son[x])continue;
		change(v[x][i],x,2);
	}
	if(x<=n)
	{
		nsl[c[x]]--;
		ans-=nsl[c[x]];
	}
	zsw[x]=ans;
}
int ff[1000005],zda[1000005];
int findf(int n)
{
	if(ff[n]==n)return n;
	return ff[n]=findf(ff[n]);
}
signed main()
{
	int m,x,y;
	n=read();
	m=read();
	for(int i=1;i<=n;i++)
	{
		c[i]=read();
		zsl[c[i]]++;
	}
	int zans=0;
	for(int i=1;i<=n;i++)
	{
		zans+=1LL*zsl[i]*(zsl[i]-1)/2;
	}
	while(cin>>x>>y)
	{
		v[x].push_back(y);
		v[y].push_back(x);
	}
	tmp=n;
	for(int i=1;i<=n;i++)if(dfn[i]==0)tarjan(i,0);
	for(int i=1;i<=n;i++)v[i].clear();
	for(int i=n+1;i<=tmp;i++)
	{
		for(int j=0;j<v[i].size();j++)
		{
			v[v[i][j]].push_back(i);
		}
	}
	for(int i=1;i<=tmp;i++)ff[i]=i;
	for(int i=1;i<=tmp;i++)
	{
		for(int j=0;j<v[i].size();j++)
		{
			//printf("%d %d\n",i,v[i][j]);
			int tx=findf(i),ty=findf(v[i][j]);
			if(tx==ty)continue;
			ff[tx]=ty;
		}
	}
	for(int i=1;i<=tmp;i++)
	{
		if(ff[i]!=i)continue;
		dfs1(i,0);
	}
	//printf("orz1\n");
	int het=0;
	for(int i=1;i<=tmp;i++)
	{
		if(ff[i]!=i)continue;
		dfszs(i,0);
		het+=ans;
		zda[i]=ans;
		change(i,0,2);
	}
	//printf("orz2\n");
	for(int i=1;i<=tmp;i++)
	{
		if(ff[i]!=i)continue;
		change(i,0,1);
		dfszsw(i,0);
	}
	//for(int i=1;i<=tmp;i++)printf("%lld %lld\n",zs[i],zsw[i]);
	for(int i=1;i<=n;i++)
	{
		int qans=het-zda[findf(i)];
		for(int j=0;j<v[i].size();j++)
		{
			if(v[i][j]==fa[i])continue;
			qans+=zs[v[i][j]];
		}
		qans+=zsw[i];
		printf("%lld\n",zans-qans);
	}
	return 0;
}