#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<functional>
using namespace std;
struct ss
{
    string s;
    int x;
};
int _,n;
char c[21];
string s;
ss a[1001];
inline bool cmp(ss a,ss b)
{
    return (a.s<b.s||a.s==b.s&&a.x>b.x);
}
int main()
{
    scanf("%d",&_);
    while (_--)
    {
        //mp.clear();
        //sum.clear();
        scanf("%d",&n);
        int i;
        for (i=1;i<=n;i++)
        {
            scanf("%s%d",c,&a[i].x);
            a[i].s.assign(c);
        }
        sort(a+1,a+n+1,cmp);
        int ans=0;
        //for (i=1;i<=n;i++) cout<<a[i].s<<" "<<a[i].x<<endl;
        i=0;
        while (i<n)
        {
            //cout<<i<<endl;
            i++;
            if (a[i].s!=a[i+1].s||i==n) ans+=a[i].x;
            else
            {
                ans+=a[i].x+a[i+1].x;
                while (i<n&&a[i].s==a[i+1].s) i++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}