#include<stdio.h>
#include<string.h>
#include<map>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int b[505][505];
int num[1005];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(b,0,sizeof(b));
        memset(num,0,sizeof(num));
        int n;
        scanf("%d",&n);
        map<string, int >s;
        int cont=1;
        for(int i=0;i<n;i++)
        {
            char a[50];
            int val;
            scanf("%s%d",a,&val);
            if(s[a]==0)
            {
                s[a]=cont++;
            }
            int u=s[a];
            b[u][num[u]++]=val;
        }
        int output=0;
        for(int i=1;i<=cont;i++)
        {
            sort(b[i],b[i]+num[i]);
            reverse(b[i],b[i]+num[i]);
            for(int j=0;j<2;j++)
            {
                output+=b[i][j];
            }
        }
        printf("%d\n",output);
    }
}