#include <bits/stdc++.h>
#include <unordered_map>
#define int long long
#define inf 1e18
#define re register
#define N 1020203
using namespace std;
const int mo=1000000007;
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}
int a[N],vis[N],sum,c[N],tot,col,sum1;
double b[N],d[N];
vector<int>g[N];
void dfs(int u){
	if (vis[u])return;
	vis[u]=col;
	sum+=a[u]*(g[u].size()+1);
	sum1+=g[u].size()+1;
	for (auto x:g[u])dfs(x);
}
void solve(){
	int n=read(),m=read();col=0;
	for (int i=1;i<=n;++i)a[i]=read(),g[i].clear(),vis[i]=0;
	for (int i=1;i<=m;++i){
		int u=read(),v=read();
		g[u].push_back(v);
		g[v].push_back(u);
	}
	for (int i=1;i<=n;++i)
		if (!vis[i]){
			sum=sum1=0;++col;
			dfs(i);
			b[col]=1.0*sum/sum1;
		}
	for (int i=1;i<=n;++i)printf("%.6lf\n",b[vis[i]]);
}
signed main(){
    int T=read();
    while (T--)solve();
    return 0;
}