#include<bits/stdc++.h>
using namespace std;
// OM NAMAH SHIVAY

// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key


#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops,O3")

#define endl "\n"
#define int long long


// int dx[4]={-1,0,1,0};
// int dy[4]={0,1,0,-1};

// int dx[8]={0,-1,-1,-1,0,1,1,1};
// int dy[8]={1,1,0,-1,-1,-1,0,1};

const int N = 200200;
const int mod = 1e9+7;
using ii = pair<int,int>;

//write on copy

void solver(){
    int n;cin>>n;
    vector<int>uni(n+1),ss(n+1);

    vector<vector<int>>mp(n+1);

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

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

    for(int i=1;i<=n;i++)
    {
        mp[uni[i]].push_back(ss[i]);
    }

    for(auto &v:mp)
    {
        sort(rbegin(v),rend(v));
    }

    for(auto &v:mp)
    {
        for(int i=1;i<v.size();i++)
        {
            v[i]+=v[i-1];
        }
    }

    int flg=1;

    for(int i=1;i<=n;i++)
    {
        int ans=0;
        for(auto &v:mp)
        {
            int sz = v.size();

            if(sz<i) 
            {
                continue;
            }

            int cnt = sz/i;

            int ii = cnt*i;

            ans+=v[ii-1];
        }

        cout<<ans<<" ";
    }

    cout<<endl;


}


signed main()
{
    IOS
    int _t;cin>>_t;while(_t--)
    solver();    
    return 0;
}

#undef int