#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0;
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void _put(T x)
{
	if (x < 0)
		x = -x, putchar('-');
	put(x);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}
template <class T>
inline void CkMax(T &x, T y) {x < y ? x = y : 0;}
template <class T>
inline T Min(T x, T y) {return x < y ? x : y;}
template <class T>
inline T Max(T x, T y) {return x > y ? x : y;}
template <class T>
inline T Abs(T x) {return x < 0 ? -x : x;}
template <class T>
inline T Sqr(T x) {return x * x;} 
// 若传入 int x 同时结果可能爆 int 应这样写 Sqr((ll)x) 

using std::map;
using std::set;
using std::pair;
using std::bitset;
using std::string;
using std::vector;
using std::complex;
using std::multiset;
using std::priority_queue;

typedef long long ll;
typedef long double ld;
typedef complex<ld> com;
typedef pair<int, int> pir;
const ld pi = acos(-1.0);
const ld eps = 1e-8;
const int Maxn = 1e9;
const int Minn = -1e9;
const int mod = 998244353; 

const int N = 1e5 + 5;
const int M = 2e5 + 5;

vector<int> v[N];
int tot_ans, n, m, C, V, tis, T_data, T = 1, _ans;
int ans[N], in_ans[N], out_ans[N], col[N], cnt[N], num[N];
int down[N], son[N], pos[N], idx[N], sze[N];
int a[N], nxt[M], to[M], adj[N];
int up[N], dfn[N], low[N];
bool bridge[M], tree[M], vis[N];

inline void linkArc(int x, int y)
{
	nxt[++T] = adj[x]; adj[x] = T; to[T] = y;
	nxt[++T] = adj[y]; adj[y] = T; to[T] = x;
}
 
inline void Tarjan(int x)
{
	dfn[x] = low[x] = ++tis;
	int y;
	for (int e = adj[x]; e; e = nxt[e])
	{
		if (e == (up[x] ^ 1))
			continue;
		if (!dfn[y = to[e]])
		{
			up[y] = e;
			Tarjan(y);
			CkMin(low[x], low[y]);
			if (dfn[x] < low[y])
				bridge[e ^ 1] = bridge[e] = true;
		}
		else 
			CkMin(low[x], dfn[y]);
	}
}

inline void dfs(int x)
{
	col[x] = C;
	pos[x] = ++V;
	idx[V] = x;
	int y;
	sze[x] = 1;
	for (int e = adj[x]; e; e = nxt[e])	
		if (!col[y = to[e]])
		{
			tree[e] = true;
			if (bridge[e])	
				down[e >> 1] = y; 
			dfs(y);
			sze[x] += sze[y];
			sze[y] > sze[son[x]] ? son[x] = y : 0;
		}
}

inline void addCnt(int x)
{
	if (cnt[x] > 0)
		--num[cnt[x]];
	++num[++cnt[x]];
	CkMax(_ans, cnt[x]);
}

inline void decCnt(int x)
{
	if (--num[cnt[x]] == 0 && _ans == cnt[x])
		--_ans;
	--cnt[x];
	if (cnt[x] > 0)
		++num[cnt[x]];
}

inline void addSubtree(int x)
{
	for (int i = pos[x]; i <= pos[x] + sze[x] - 1; ++i)
		addCnt(a[idx[i]]);
}

inline void decSubtree(int x)
{
	for (int i = pos[x]; i <= pos[x] + sze[x] - 1; ++i)	
		decCnt(a[idx[i]]);
}

inline void dfsTraverse(int x)
{
	vis[x] = true;
	for (int y : v[x])
	{	
		if (y == son[x])
			continue ;
		dfsTraverse(y);
		decSubtree(y);
	}
	if (son[x])
		dfsTraverse(son[x]);
	addCnt(a[x]);
	for (int y : v[x])
	{
		if (y == son[x])
			continue ;
		addSubtree(y);
	}
	in_ans[x] = _ans;
//	std::cout << "(" << x << " " << _ans << std::endl;
}

inline void dfsTraverse2(int x)
{
	for (int y : v[x])
	{
		if (y == son[x])
			continue ;
		dfsTraverse2(y);
		addSubtree(y);
	}
	if (son[x])
		dfsTraverse2(son[x]);
	decCnt(a[x]);
	for (int y : v[x])
	{
		if (y == son[x])
			continue ;
		decSubtree(y);
	}
	out_ans[x] = _ans;
//	std::cout << ")" << x << " " << _ans << std::endl;
}

int main()
{
	read(T_data);
	while (T_data--)
	{
		read(n); read(m); 
		C = tot_ans = tis = V = 0;
		for (int i = 1; i <= n; ++i)
			read(a[i]);	
		for (int i = 1, u, v; i <= m; ++i)
		{
			read(u); read(v);
 			linkArc(u, v);
		}
		for (int i = 1; i <= n; ++i)
			if (!dfn[i])
				Tarjan(i);
		for (int i = 1; i <= n; ++i)
			if (!col[i])
			{
				++C;
				dfs(i);
			}
		for (int i = 1; i <= n; ++i)
			for (int e = adj[i]; e; e = nxt[e])
				if (tree[e])
					v[i].emplace_back(to[e]);
		for (int i = 1; i <= n; ++i)
			if (!vis[i])
			{
				dfsTraverse(i);
				ans[col[i]] = _ans; 
				tot_ans += _ans;
				dfsTraverse2(i);
			}
		for (int i = 1; i <= m; ++i)
		{
			if (bridge[i << 1])
				put(tot_ans - ans[col[down[i]]] + in_ans[down[i]] + out_ans[down[i]]);
			else 
				put(tot_ans);
			putchar(i < m ? ' ' : '\n');
		}
		
		for (int i = 1; i <= T; ++i)
			bridge[i] = tree[i] = false;
		T = 1;
		for (int i = 1; i <= n; ++i)
		{
			v[i].clear();
			ans[i] = in_ans[i] = out_ans[i] = 0;
			dfn[i] = low[i] = 0;
			up[i] = down[i] = col[i] = adj[i] = sze[i] = son[i] = pos[i] = idx[i] = 0;
			vis[i] = false;
		}
	}
}
/*
3
7 5
1 2 1 2 1 2 1
1 2
1 3
2 4
5 6
5 7

3 3
1 2 3
1 2
1 3
2 3

2 3
12345 54321
1 2
1 2
1 1
*/