#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
struct node{
    string str;
    int vl;
};
map<string,int>mp;
node cl[105];
bool cmp(node a,node b){
    return a.vl>b.vl;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        mp.clear();
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            cin>>cl[i].str>>cl[i].vl;
        }
        sort(cl+1,cl+1+n,cmp);
        int ans=0;
        for(int i=1;i<=n;i++){
            if(mp[cl[i].str]==2)continue;
            mp[cl[i].str]++;
            ans+=cl[i].vl;
        }
        printf("%d\n",ans);
    }
    return 0;
}