#include <iostream>

#include <algorithm>

#include <vector>

#include <map>

using namespace std;

typedef long long LL;

const int N = 2e5+10;

int b[N],c[N];

int main()

{

    int t;

    cin >> t;

    while(t --)

    {

        int n;

        scanf("%d", &n);

        map<int,vector<LL>> a;//存第二波输入

        for(int i = 1; i <= n; i ++)    scanf("%d", &b[i]); //存所属队

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

            int x;

            scanf("%d", &x);

            a[b[i]].push_back(x);

        }

        vector<LL> res(n+1);//存结果

        for(auto p1:a)//遍历每一队

        {

            vector<LL> &p = p1.second;

            sort(p.begin(), p.end());

            int len = p.size();

            for(int i = 1; i < len; ++i)

                p[i] += p[i-1];

            for(int i = 1; i <= len; i ++)

                res[i]+=p[len-1]-((len%i)?p[len%i-1]:0LL);//把这一队的算出来

        }

        for(int i = 1; i <= n; i ++)

            cout << res[i] << ' ';

        puts("");

    }

    return 0;

}