#include<cstdio>
#include<iostream>
#include<cstring>
#include<map>
#include<string>
#include<algorithm>
#define clr(x) memset(x,0,sizeof(x))
using namespace std;
struct node
{
    string s;
    int val;
}str[110];
map<string,int> mapp;
bool cmp(node a,node b)
{
    return a.val>b.val;
}
int main()
{
    int T,n,m,value;
    scanf("%d",&T);
    while(T--)
    {
        mapp.erase(mapp.begin(),mapp.end());
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            cin>>str[i].s>>str[i].val;
        }
        sort(str+1,str+n+1,cmp);
        value=0;
        for(int i=1;i<=n;i++)
            if(mapp[str[i].s]<2)
            {
                value+=str[i].val;
                mapp[str[i].s]++;
            }
        printf("%d\n",value);
    }
    return 0;
}