#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
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 n,m;
int a[1000005];
vector<pair<int,int>> e[1000005];
//Two meows, both alike in dignity,
//in fair Verona, where we lay our scene.
//From ancient grudge break to new mutiny,
//where civil blood make civil hands unclean.
int ans[1000005];
int s[1000005];
int c[1000005];
int l;
bool v[1000005];
void chk(int x){
	v[x]=1;s[++l]=a[x];
	for(auto it:e[x]){
		int to=it.first,id=it.second;
		if(!v[to])chk(to);
	}
}
int cnt,len;
int mx[1000005];
bool cut[1000005];
int dfn[1000005],low[1000005];
map<pair<int,int>,int> wp;
void dfs(int x,int f){
	dfn[x]=low[x]=++cnt;
	for(auto it:e[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		if(!dfn[to]){
			s[++l]=id,dfs(to,x),low[x]=min(low[x],low[to]);
			if(low[to]>dfn[x]&&wp[{x,to}]==1)cut[id]=1;
		}
		else low[x]=min(low[x],dfn[to]);
	}
	//cout<<x<<" "<<low[x]<<" "<<dfn[x]<<"\n";
}
int bel[1000005];
void dfs2(int x){
	v[x]=1;bel[x]=len;
	s[++l]=a[x];
	for(auto it:e[x]){
		int to=it.first,id=it.second;
		if(v[to])continue;
		if(cut[id])continue;
		dfs2(to);
	}
}
vector<pair<int,int>> info[1000005];
int x[1000005],y[1000005];
vector<pair<int,int>> g[1000005];
int sz[1000005],hs[1000005];
void dfs_init(int x,int f){
	sz[x]=(int)info[x].size();hs[x]=-1;v[x]=1;
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		dfs_init(to,x);
		sz[x]+=sz[to];
		if(hs[x]==-1||sz[to]>sz[hs[x]])hs[x]=to;
	}
}
int cl[1000005];
multiset<int> st;
int dq[1000005];
int tp;
void ins(int x){
	//cout<<"ins "<<x<<"\n";
	dq[++tp]=x;
	//return;
	for(auto v:info[x]){
		int key=v.first,val=v.second;
		if(cl[key])st.erase(st.lower_bound(cl[key]));
		cl[key]+=val;
		if(cl[key])st.insert(cl[key]);
	}
}
void del(int x){
	//cout<<"del "<<x<<"\n";
	//return;
	for(auto v:info[x]){
		int key=v.first,val=v.second;
		if(cl[key])st.erase(st.lower_bound(cl[key]));
		cl[key]-=val;
		if(cl[key])st.insert(cl[key]);
	}
}
void clear(){
	while(tp){
		del(dq[tp]),tp--;
	}
}
bool added[1000005];
void wcz(int x,int f,int fp){
	int eid=-1;
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		if(to==hs[x]){eid=id;continue;}
		wcz(to,x,id);clear();
	}
	if(hs[x]!=-1)wcz(hs[x],x,eid);
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		if(to==hs[x])continue;
		wcz(to,x,id);
	}
	ins(x);
	if(fp&&!added[fp]){
		added[fp]=1;
		ans[fp]+=(st.empty()?0ll:*(--st.end()));
		//cout<<fp<<"+="<<(st.empty()?0ll:*(--st.end()))<<"\n";
	}
}
void add2(int x){
	//cout<<"ins "<<x<<"\n";
	//return;
	for(auto v:info[x]){
		int key=v.first,val=v.second;
		if(cl[key])st.erase(st.lower_bound(cl[key]));
		cl[key]+=val;
		if(cl[key])st.insert(cl[key]);
	}
}
void del2(int x,int fl=1){
	if(fl)dq[++tp]=x;
	//cout<<"del "<<x<<"\n";
	//return;
	for(auto v:info[x]){
		int key=v.first,val=v.second;
		if(cl[key])st.erase(st.lower_bound(cl[key]));
		cl[key]-=val;
		if(cl[key])st.insert(cl[key]);
	}
}
void clear2(){
	while(tp){
		add2(dq[tp]),tp--;
	}
}
int lol;
vector<int> al;
void dfs_init2(int x,int f){
	add2(x);lol++;al.push_back(x);
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		dfs_init2(to,x);
	}
}
bool added2[1000005];
void wyn(int x,int f,int fp){
	int eid=-1;
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		if(to==hs[x]){eid=id;continue;}
		wyn(to,x,id);clear2();
	}
	if(hs[x]!=-1)wyn(hs[x],x,eid);
	for(auto it:g[x]){
		int to=it.first,id=it.second;
		if(to==f)continue;
		if(to==hs[x])continue;
		wyn(to,x,id);
	}
	del2(x);
	if(fp&&!added2[fp]){
		added2[fp]=1;
		ans[fp]+=(st.empty()?0ll:*(--st.end()));
		//cout<<fp<<"+="<<(st.empty()?0ll:*(--st.end()))<<"\n";
	}
}
signed main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=m;i++){
		int u=read(),v=read();x[i]=u,y[i]=v;
		wp[{u,v}]++,wp[{v,u}]++;
		e[u].push_back({v,i});
		e[v].push_back({u,i});
	}
	int tot=0;
	for(int i=1;i<=n;i++){
		if(!v[i]){
			l=0,chk(i);
			for(int j=1;j<=l;j++)c[s[j]]++;
			for(int j=1;j<=l;j++)mx[i]=max(mx[i],c[s[j]]);
			tot+=mx[i];
			for(int j=1;j<=l;j++)c[s[j]]--;
		}
	}
	for(int i=1;i<=n;i++)v[i]=0;
	for(int i=1;i<=m;i++)ans[i]=tot;
	for(int i=1;i<=n;i++){
		if(!dfn[i]){
			l=0;
			dfs(i,0);
			for(int j=1;j<=l;j++)if(cut[s[j]])ans[s[j]]-=mx[i];
			//cout<<"\n";
		}
	}
	for(int i=1;i<=n;i++){
		if(!v[i]){
			l=0,++len;
			dfs2(i);
			vector<pair<int,int>> tmp;
			for(int j=1;j<=l;j++)c[s[j]]++;
			for(int j=1;j<=l;j++){
				if(c[s[j]])tmp.push_back({s[j],c[s[j]]}),c[s[j]]=0;
			}
			//for(auto [v,w]:tmp)cout<<v<<" "<<w<<"\n";
			info[len]=tmp;
		}
	}
	for(int i=1;i<=n;i++)v[i]=0;
	for(int i=1;i<=m;i++){
		if(cut[i]){
			//cout<<bel[x[i]]<<" "<<bel[y[i]]<<"\n";
			g[bel[x[i]]].push_back({bel[y[i]],i});
			g[bel[y[i]]].push_back({bel[x[i]],i});
		}
	}
	for(int i=1;i<=len;i++){
		if(!v[i]){
			tp=0;
			st.clear();
			dfs_init(i,0);
			wcz(i,0,0);
			clear();tp=0,st.clear();lol=0;al.clear();
			dfs_init2(i,0);
			wyn(i,0,0);
			//cout<<tp<<" "<<lol<<"\n";
			clear2();
			for(auto it:al)del2(it,0);
		}
	}
	for(int i=1;i<=m;i++)cout<<ans[i]<<" ";
	return 0;
}
//look at my code
//my code is amazing