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

int n,m;
const int mx=1e5+5;
int a[mx], u[mx], v[mx], res=0, q1, q2;
vector <int> vt[mx];
bool seen[mx];

void bfs(int i){

    vector<int> lt;
    lt.push_back(i);
    queue<int> q;
    q.push(i);
    seen[i]=1;
    while (!q.empty()){

        int u=q.front();
        q.pop();
        for (auto v:vt[u]){
            if (!seen[v]){
                q.push(v);
                seen[v]=1;
                lt.push_back(v);
            }
        }

    }

    int d=0;
    map <int,int> m;
    for (auto v:lt){
        m[a[v]]++;
        d=max(d,m[a[v]]);
    }
    res+=d;
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int t; cin >> t;
    while (t--){

        cin >> n >> m;

        for (int i=1;i<=n;i++) cin >> a[i];

        for (int i=1; i<=m;i++){

            cin >> u[i] >> v[i];

        }

        for (int i=1;i<=m;i++){

            for (int j=1; j<=n; j++) vt[j].clear();
            for (int j=1; j<=m; j++){
                if (j==i) continue;
                vt[u[j]].push_back(v[j]);
                vt[v[j]].push_back(u[j]);
            }
            for (int j=1;j<=n;j++) seen[j]=0;
            res=0;
            for (int j=1;j<=n;j++){
                if (!seen[j]) bfs(j);
            }
            if (i!=m) cout << res<<' ';
            //else cout << res<<'\n';

        }
        //cout << '\n';

    }
    return 0;

}