#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#define ll long long
#define mst(a,x) memset(a,x,sizeof(a))
#define For(i, n) for(int i = 0; i < n; i++)
using namespace std;

const int N = 105;
struct Item{
    char s[N];
    int val;
    void Read() {
        scanf("%s%d", s, &val);
    }
    bool operator < (const Item& b)const{
        int rst = strcmp(s, b.s);
        if(rst) return rst < 0;
        return val > b.val;
    }
}a[N];

int main() {
    int T;

    scanf("%d", &T);
    while(T--) {
        int ans = 0, n;
        scanf("%d", &n);
        For(i, n) a[i].Read();
        sort(a, a + n);
        int cnt;
        For(i, n) {
//            printf("%s %d\n", a[i].s, a[i].val);
            if(!i || strcmp(a[i].s, a[i - 1].s)) {
                cnt = 1;
            }else{
                cnt++;
            }
            if(cnt < 3) ans += a[i].val;
        }
        printf("%d\n", ans);
    }
    return 0;
}