#include<cstdio>
#include<cstring>
#include<cctype>
#include<string>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
using namespace std;
inline int read() {
    int x=0,f=1;char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0';
    return x*f;
}
typedef long long ll;
const int maxn=110;
struct A {
    string s;
    int v;
    bool operator < (const A& ths) {
        return s<ths.s||(s==ths.s&&v>ths.v);
    }
}B[maxn];
int cmp(const A& a,const A& b) {return a.s<b.s||(a.s==b.s&&a.v>b.v);}
typedef long long ll;
char s[15];
void solve() {
    int n=read();
    rep(i,1,n) {
        scanf("%s%d",s,&B[i].v);
        B[i].s=s;
    }
    sort(B+1,B+n+1,cmp);
    int ans=0,c=0;
    rep(i,1,n) {
        if(i>1&&B[i].s==B[i-1].s) c++;
        else c=1;
        if(c<=2) ans+=B[i].v;
    }
    printf("%d\n",ans);
}
int main() {
    dwn(T,read(),1) solve();
    return 0;
}