#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <map>
using namespace std;
const int maxn = 2*1e5+100;
struct node
{
    char s[15];
    int v;
}a[100000];
bool cmp(node a,node b)
{
    return a.v>b.v;
}
map<string ,int >mapple;
int main(void)
{

    int t;
    while(cin>>t)
    {
        while(t--)
        {
            int n;
            scanf("%d",&n);
            mapple.clear();
            for(int i=0;i<n;i++)
                scanf("%s %d",a[i].s,&a[i].v);
            sort(a,a+n,cmp);
            int ans = 0;
            for(int i=0;i<n;i++)
            {
                if(mapple[a[i].s]==2)
                    continue;
                ans += a[i].v;
                mapple[a[i].s]++;
            }
            printf("%d\n",ans);
        }

    }

    return 0;
}