#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <string.h>
#include <string>
#include <cmath>
using namespace std;
struct Clas
{
    string name;
    int val;
}C[105];
bool cmp(Clas a,Clas b)
{
    return a.val>b.val;
}
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        map<string,int>M;
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            cin>>C[i].name;
            scanf("%d",&C[i].val);
        }
        int ans=0;
        sort(C,C+n,cmp);
        for(int i=0;i<n;i++)
        {
            if(M[C[i].name]<2)
            {
                //cout<<C[i].name<<endl;
                M[C[i].name]++;
                ans+=C[i].val;
            }
        }
        cout<<ans<<endl;
    }
    //system("pause");
}