#include <bits/stdc++.h>

using namespace std;
const int MAXN=110;
int n,m;
struct node
{
    char s[110];
    int val;
    bool operator<(const node &a)const
    {
        if(strcmp(s,a.s)!=0)return strcmp(s,a.s)<0;
        else return val>a.val;
    }
}p[MAXN];
int main()
{
    int i;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;i<n;++i)scanf("%s%d",p[i].s,&p[i].val);
        sort(p,p+n);
        int ans=0;
        ans+=p[0].val;
        int cnt=1;
        for(i=1;i<n;++i)
        {
            if(!strcmp(p[i].s,p[i-1].s))
            {
                cnt++;
                if(cnt<=2)ans+=p[i].val;
            }
            else
            {
                ans+=p[i].val;
                cnt=1;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}