#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <iostream>

using namespace std;

const int maxn = 210;
struct node {
    string s;
    int v;
} s[maxn];
int n;
int ans;
bool cmp ( node x1 , node x2 ) {
    if ( x1.s == x2.s ) return x1.v > x2.v;
    return x1.s < x2.s;
}
void work () {
    int i , cnt;
    scanf ( "%d" , &n );
    for ( i = 1 ; i <= n ; i++ ) {
        cin >> s[i].s >> s[i].v;
    }
    sort ( s + 1 , s + 1 + n , cmp );
    ans = 0;
    cnt = 1;
    for ( i = 1 ; i <= n ; i++ ) {
        if ( i != 1 && s[i].s == s[i-1].s ) {
            cnt++;
        }
        else cnt = 1;
        if ( cnt <= 2 ) ans += s[i].v;
    }
    printf ( "%d\n" , ans );
}
int main () {
    int t;
    scanf ( "%d" , &t );
    while ( t-- ) work ();
    return 0;
}