#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 100+5;
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;

struct Ke
{
    string LeiXing;
    int v;
}a[maxn];

int cmp(Ke a,Ke b)
{
    return a.v>b.v;
}
int main()
{
    //freopen("in","r",stdin);
    //freopen("out","w",stdout);

    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=0;i<n;++i)
        {
            cin>>a[i].LeiXing>>a[i].v;
        }

        sort(a,a+n,cmp);
        map<string,int> mp;
        mp.clear();

        int ans = 0;
        for(int i=0;i<n;++i)
        {
            if(mp[a[i].LeiXing]<2)
            {
                ans+=a[i].v;
                mp[a[i].LeiXing] ++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}