// #pragma GCC optimize(2)
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
#include<bitset>
#include<list>
#include<unordered_map>
#define lowbit(x) x&-x
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
template<typename T>
inline void read(T &x)
{
	T f=1;x=0;
	char ch=getchar();
	while(0==isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(0!=isdigit(ch)) x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	x*=f;
}
template<typename T>
inline void write(T x)
{
	if(x<0){x=~(x-1);putchar('-');}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const int inf=0x3f3f3f3f;
const int N=1e6+100;
const int M=1e3+100;
int u[N],s[N],id[N],cnt;
vector<LL>node[N];
vector<LL>sum[M];
void init(int n) {
	for(int i=1;i<=n;i++) {
		node[i].clear();
		id[i]=0;
	}
	for(int i=1;i<M;i++) {
		sum[i].clear();
	}
	cnt=0;
}
int main()
{
#ifndef ONLINE_JUDGE
//  freopen("data.in.txt","r",stdin);
//  freopen("data.out.txt","w",stdout);
#endif
//  ios::sync_with_stdio(false);
	int w;
	cin>>w;
	while(w--) {
		int n;
		read(n);
		init(n);
		for(int i=1;i<=n;i++) {
			read(u[i]);
		}
		for(int i=1;i<=n;i++) {
			int x;
			read(x);
			node[u[i]].push_back(x);
		}
		for(int i=1;i<=n;i++) {
			if(node[i].empty()) {
				continue;
			}
			sort(node[i].begin(),node[i].end(),greater<LL>());
			int sz=node[i].size();
			if(!id[sz]) {
				id[sz]=++cnt;
				sum[cnt].resize(sz);
			}
			for(int j=0;j<sz;j++) {
				sum[id[sz]][j]+=node[i][j];
			}
		}
		for(int i=1;i<=cnt;i++) {
			for(int j=1;j<(int)sum[i].size();j++) {
				sum[i][j]+=sum[i][j-1];
			}
		}
		for(int i=1;i<=n;i++) {
			LL ans=0;
			for(int j=1;j<=cnt;j++) {
				int pos=sum[j].size()/i*i-1;
				if(pos!=-1) {
					ans+=sum[j][pos];
				}
			}
			cout<<ans<<' ';
		}
		cout<<endl;
	}
    return 0;
}

	  	 	    				  		 	 		 		    	