//B站关注 艾尔莎 喵
//All OK
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(9)
#define INF 1ll*1e10
#define LNF (1ll << 60)
#define PII pair<int, int>
#define PI acos(-1)
#define ll long long
// #define ll __int128 
#define int ll
#define endl '\n'
using namespace std;

const int N = 1e5 + 10;
int n, m;
double sum[N];
ll sz[N], d[N], a[N];
int f[N];

int find(int x){
    return x == f[x] ? x : f[x] = find(f[x]);
}

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
        f[i] = i, sum[i] = sz[i] = 0, d[i] = 1;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];

    for(int i = 1; i <= m; i ++){
        int u, v;
        cin >> u >> v;
        d[u] ++, d[v] ++;
        int fx = find(u), fy = find(v);
        // cout << fx << ' ' << fy << endl;
        if(fx != fy) f[fy] = fx;
    }

    for(int i = 1; i <= n; i ++){
        int x = find(i);
        sum[x] += a[i] * d[i];
        sz[x] += d[i];
    }

    for(int i = 1; i <= n; i ++){
        int x = find(i);
        cout << (double)(sum[x] / sz[x]) << endl;
    }
}   

signed main(){
    ios;

    // init();
    int _ = 1;
    cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case " << __ << ": ";
        solve();
    }

    return 0;
}