#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct node
{
    string s;
    int val;
    bool operator<(const node &t) const
    {
        if(s==t.s)
            return val>t.val;
        return s<t.s;
    }
}a[110];
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n;
        for(int i=0;i<n;i++)
            cin>>a[i].s>>a[i].val;
        sort(a,a+n);
        int ans=0;
        string rep;
        for(int i=0,time=0;i<n;i++)
        {
            if(time==0)
                rep=a[i].s,time++,ans+=a[i].val;
            else
                if(a[i].s==rep)
                {
                    if(time<2)
                        time++,ans+=a[i].val;
                    else
                        continue;
                }
                else
                    time=1,rep=a[i].s,ans+=a[i].val;
        }
        cout<<ans<<endl;
    }
    return 0;
}