#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 110
struct Node
{
    string na;
    int v[MAXN];
    int cv;
} a[MAXN];
int cmp(int a,int b)//结构体排序
{
    return a>b;//对价值降序排列
}
int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("F:/cb/read.txt","r",stdin);
    //freopen("F:/cb/out.txt","w",stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n,k=0,ans=0;
        string s;
        int temp;
        cin>>n;
        for(int i=0; i<n; ++i)
        {
            bool flag=false;
            a[i].cv=0;
            cin>>s>>temp;
            for(int j=0; j<k; ++j)
            {
                if(a[j].na==s)
                {
                    a[j].v[a[j].cv++]=temp;
                    flag=true;
                    break;
                }
            }
            if(!flag)
            {
                a[k].na=s;
                a[k].v[a[k].cv++]=temp;
                ++k;
            }
        }
        //qsort(a,n,sizeof(a[0]),cmp);//排序
        for(int i=0; i<n; ++i)
            sort(a[i].v,a[i].v+a[i].cv,cmp);//排序
        /*for(int i=0; i<n; ++i)
        {
            for(int j=0; j<a[i].cv; ++j)
                cout<<a[i].v[j]<<" ";
            cout<<endl;
        }*/
        for(int i=0; i<n; ++i)
        {
            int cf=0;
            for(int j=0; j<a[i].cv; ++j)
            {
                if(cf==2) break;
                ans+=a[i].v[j];
                ++cf;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*

*/