#include <bits/stdc++.h>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
const int N = 1e5 + 5;

int n, m, sz, ti, mx;
int a[N], cnt[N], num[N], siz[N], sum[N], rev[N], son[N];
int dfn[N], low[N], sd[N], ans[N];
vector<int> st, C[N];
vector<pair<int, int>> G[N], E[N];

void tarjan(int u, int from = 0) {
  st.push_back(u);
  dfn[u] = low[u] = ++ti;
  for (auto [v, id] : G[u]) if (id != from) {
    if (!dfn[v]) {
      tarjan(v, id);
      low[u] = min(low[u], low[v]);
    } else low[u] = min(low[u], dfn[v]);
  }
  if (low[u] == dfn[u]) {
    ++sz;
    while (1) {
      int v = st.back();
      st.pop_back();
      sd[v] = sz;
      C[sz].push_back(a[v]);
      if (v == u) break;
    }
  }
}
void add(int u, int v) {
  if (v == 1) mx = max(mx, cnt[u] + v);
  else if (mx == cnt[u] && num[mx] == 1) mx--;
  if (cnt[u]) num[cnt[u]]--;
  if (cnt[u] += v) num[cnt[u]]++;
}
void dfs1(int u, int fa) {
  dfn[u] = ++ti, rev[ti] = u, siz[u] = 1;
  sum[u] = C[u].size();
  for (auto [v, id] : E[u]) if (v != fa) {
    dfs1(v, u);
    siz[u] += siz[v];
    sum[u] += sum[v];
    if (sum[v] > sum[son[u]]) son[u] = v;
  }
}
void dfs2(int u, int pa, int kp, int d, int dd = -1) {
  for (auto [v, id] : E[u]) if (v != son[u] && id != pa) dfs2(v, id, 0, d, dd);
  for (auto [v, id] : E[u]) if (v == son[u] && id != pa) dfs2(v, id, 1, d, dd);
  for (auto x : C[u]) add(x, d);
  for (auto [v, id] : E[u]) if (v != son[u] && id != pa) {
    for (int i = dfn[v]; i < dfn[v] + siz[v]; ++i) {
      int cur = rev[i];
      for (auto x : C[cur]) add(x, d);
    }
  }
  if (pa) ans[pa] += mx - (~dd ? dd : 0);
  if (!kp) {
    for (int i = dfn[u]; i < dfn[u] + siz[u]; ++i) {
      int cur = rev[i];
      for (auto x : C[cur]) add(x, -d);
    }
  }
}

void solve() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i)
    cin >> a[i], dfn[i] = low[i] = sd[i] = 0;
  for (int i = 1, u, v; i <= m; ++i) {
    ans[i] = 0;
    cin >> u >> v;
    G[u].push_back({v, i});
    G[v].push_back({u, i});
  }
  for (int i = 1; i <= n; ++i) if (!dfn[i]) tarjan(i);
  for (int u = 1; u <= n; ++u)
    for (auto [v, id] : G[u]) if (sd[u] != sd[v]) {
      E[sd[u]].push_back({sd[v], id});
    }
  ti = 0;
  for (int i = 1; i <= sz; ++i) dfn[i] = 0;
  int res = 0;
  for (int i = 1; i <= sz; ++i) if (!dfn[i]) {
    dfs1(i, 0);
    dfs2(i, 0, 1, 1);
    res += mx;
    dfs2(i, 0, 1, -1, mx);
  }
  for (int i = 1; i <= m; ++i)
    cout << ans[i] + res << " \n"[i == m];
  for (int i = 1; i <= n; ++i) {
    dfn[i] = low[i] = sd[i] = 0;
    G[i].clear(), E[i].clear(), C[i].clear();
    son[i] = 0;
  }
  for (int i = 1; i <= m; ++i) ans[i] = 0;
  ti = sz = 0;
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}