#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <ctime>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define calm (l+r)>>1
const int INF = 2139062143;

map<string,int> x;
struct P{
    string name;
    int num;
}a[111];
inline bool cmp(P a,P b){
    if(a.num!=b.num)return a.num>b.num;
    return a.name>b.name;
}
int main(){
    //freopen("D://input.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        int n;scanf("%d",&n);
        x.clear();
        for(int i=1;i<=n;i++){
            cin>>a[i].name>>a[i].num;
        }
        sort(a+1,a+n+1,cmp);
        int ans=0;
        for(int i=1;i<=n;i++){
            if(x[a[i].name]<2){
                ans+=a[i].num;
                x[a[i].name]++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}