#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<cstring>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<math.h>
#include<time.h>
#define mod 1000000007
#define MAXN 200010
#define INIF 2147483646
#define inf 0x3f3f3f3f
//#define ll long long
using namespace std;
//typedef __int64 ll;
struct course
{
    string s;
    int v;
}c[110];
int cmp(course a,course b){
    if(a.s!=b.s)
        return a.s<b.s;
    return a.v>b.v;
}
int main()
{
    //freopen("F://in.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            cin>>c[i].s;
            scanf("%d",&c[i].v);
        }
        sort(c,c+n,cmp);
        int ans=0;
        map<string,int> m;
        for(int i=0;i<n;i++){
            if(m[c[i].s]<2){
                ans+=c[i].v;
                m[c[i].s]++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}