#include <bits/stdc++.h>

#define int long long

#define file(task) if(fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); }
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define fi first
#define se second
#define SZ(X) (int)(X.size())
#define pb push_back
#define all(X) X.begin(), X.end()

using namespace std;

typedef pair<int, int> pii;

const int maxN = 1e6;

int N, M;
int g[maxN+5];
pii e[maxN+5];

void read_input()
{
  cin >> N >> M;
  FOR(i, 1, N) cin >> g[i];
  FOR(i, 1, M)
  {
    cin >> e[i].fi >> e[i].se;
  }
}

namespace trau
{
  vector<int> adj[maxN+5];
  vector<int> tplt[maxN+5];
  int K = 0;
  int vst[maxN+5];

  void clr()
  {
    K = 0;
    FOR(i, 1, N)
    {
      adj[i].clear();
      vst[i] = false;
      tplt[i].clear();
    }
  }

  void dfs(int u)
  {
    vst[u] = true;
    tplt[K].pb(u);
    for(int v : adj[u])
    {
      if(vst[v] == true) continue;
      dfs(v);
    }
  }

  void solve()
  {
    FOR(i, 1, M)
    {
      clr();
      int res = 0;
      FOR(j, 1, M)
      {
        if(i == j) continue;
        int u = e[j].fi, v = e[j].se;
        adj[u].pb(v);
        adj[v].pb(u);
      }
      FOR(j, 1, N)
      {
        if(vst[j] == false)
        {
          ++K;
          dfs(j);
        }
      }
      FOR(j, 1, K)
      {
        sort(all(tplt[j]), [](int &x, int &y)
        {
          return g[x] < g[y];
        });
        int cnt = 0, t = 0;
        while(t < SZ(tplt[j]))
        {
          int curC = g[tplt[j][t]], curCNT = 0;
          while(t < SZ(tplt[j]) && curC == g[tplt[j][t]])
          {
            ++curCNT;
            ++t;
          }
          cnt = max(cnt, curCNT);
        }
        res += cnt;
      }
      cout << res;
      if(i != M) cout << " ";
    }
    cout << '\n';
  }
}

void solve()
{
  int testcase; cin >> testcase;
  while(testcase --> 0)
  {
    read_input();
    trau::solve();
  }
}

int32_t main()
{
  cin.tie(0)->sync_with_stdio(0);

  file("PARK");

  solve();

  return 0;
}