#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;

struct{
	int cnt_v[N];
	vector<int>cis[N];
	int val,cnt;
	void push(int x){
		cis[++cnt_v[x]].push_back(x);
		if(cnt_v[x]>cnt)cnt=cnt_v[val=x];
	}
	void pop(int x){
		cis[--cnt_v[x]].push_back(x);
		while(!cis[cnt].empty()&&cnt_v[cis[cnt].back()]!=cnt)
			cis[cnt].pop_back();
		if(cis[cnt].empty())--cnt;
		else val=cis[cnt].back();
	}
	void clear(){
		for(int i=1;i<=cnt;++i){
			for(int x:cis[i])cnt_v[x]=0;
			cis[i]={};
		}
		val=cnt=0;
	}
}Q;

int n,m,va[N],fa[N];
vector<int>a[N],A[N];

struct{int nxt,v;}edge[N<<1];
int head[N],ec;
void add(int u,int v){edge[++ec]={head[u],v};head[u]=ec;}
int dfn[N],low[N],dfc,bc,c[N],dfu[N],s[N],tp;
void dfs(int u,int in){
	dfu[dfn[s[++tp]=u]=low[u]=++dfc]=u;
	for(int i=head[u];i;i=edge[i].nxt){
		if(i==in)continue;
		int v=edge[i].v;
		if(!dfn[v])dfs(v,i^1),low[u]=min(low[u],low[v]);
		else low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]&&++bc)while(s[tp+1]!=u)a[bc].push_back(va[s[tp]]),c[s[tp--]]=bc;
}

vector<int>G[N];
int siz[N],son[N];
void cal_son(int u,int fa){
	::fa[u]=fa;
	siz[u]=a[u].size();son[u]=0;
	for(int v:G[u])if(v!=fa){
		cal_son(v,u);
		if(siz[son[u]]<siz[v])son[u]=v;
		siz[u]+=siz[v];
	}
}
int c0[N],c1[N];
void dfs0(int u,int fa){
	for(int v:G[u])if(v!=fa&&v!=son[u])dfs0(v,u),Q.clear();
	A[u]=a[u];
	if(son[u]){
		dfs0(son[u],u);
		for(int va:a[u])A[son[u]].push_back(va);
		A[u]={};swap(A[u],A[son[u]]);
	}
	for(int v:a[u])Q.push(v);
	for(int v:G[u])if(v!=fa&&v!=son[u])for(int va:A[v])Q.push(va),A[u].push_back(va);
	c0[u]=Q.cnt;
}
void dfs1(int u,int fa){
	c1[u]=Q.cnt;
	for(int va:a[u])Q.push(va);
	for(int v:G[u])if(v!=fa&&v!=son[u])
		for(int va:A[v])Q.push(va);
	if(son[u])dfs1(son[u],u);
	for(int v:G[u])if(v!=fa&&v!=son[u]){
		for(int va:A[v])Q.pop(va);
		dfs1(v,u);
	}
}
int ans,dta[N];
void sol(){
	#define cls(a) memset(a+1,0,n*sizeof a[0])
	cls(head),cls(dfn),cls(low),cls(c);dfc=bc=ans=0;ec=1;tp=0;
	cls(s);
	cin>>n>>m;
	memset(dta+1,0,m*sizeof dta[0]);
	for(int i=1;i<=n;++i)cin>>va[i],a[i].clear(),G[i].clear();
	for(int i=1,u,v;i<=m;++i)
		cin>>u>>v,add(u,v),add(v,u);
	for(int u=1;u<=n;++u)if(!dfn[u]){
		int pdfc=dfc;
		dfs(u,0);
		for(int i=pdfc+1;i<=dfc;++i)
			for(int u=dfu[i],i=head[u];i;i=edge[i].nxt)
				if(int v=edge[i].v;c[u]!=c[v])
					G[c[u]].push_back(c[v]);
		cal_son(c[u],0);
		dfs0(c[u],0);Q.clear();
		dfs1(c[u],0);Q.clear();
		int vv=c0[c[u]];
		ans+=vv;
		for(int i=pdfc+1;i<=dfc;++i)
			for(int u=dfu[i],i=head[u];i;i=edge[i].nxt)
				if(int v=edge[i].v;c[u]!=c[v])
					if(fa[c[u]]==c[v])dta[i>>1]=c1[c[u]]+c0[c[u]]-vv;
					else dta[i>>1]=c1[c[v]]+c0[c[v]]-vv;
	}
	for(int i=1;i<=m;++i)
		cout<<ans+dta[i]<<" \n"[i==m];
}

signed main() {
	ios::sync_with_stdio(0),cin.tie(0);
	int T;cin>>T;while(T--)sol();
}