#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4+10;
map<string,int>q;
struct node
{
    char str[110];
    int num;
}p[N];
int cmp(node x,node y)
{
    return x.num>=y.num;
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        q.clear();
        int n;
        scanf("%d", &n);
        for(int i=0;i<n;i++)
        {
            scanf("%s %d", p[i].str, &p[i].num);
        }
        sort(p,p+n,cmp);
        int ans=0;
        for(int i=0;i<n;i++)
        {
            if(!q[p[i].str])
            {
                q[p[i].str]=1;
                ans+=p[i].num;
            }
            else if(q[p[i].str]==1)
            {
                q[p[i].str]=2;
                ans+=p[i].num;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}