#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const LL INF = 1e9+5;
const int MAXN = 1e6+5;
const int MOD = 1e9+7;
const double eps = 1e-7;
const double PI = acos(-1);
struct Node {
    string name;
    int sc;
}a[MAXN];
inline bool cmp(Node a, Node b){
    if(a.name == b.name)
        return a.sc > b.sc;
    return a.name < b.name;
}
int main(){
    int T;
    scanf("%d", &T);
    for (int cas=1; cas<=T; cas++){
        int n;
        scanf("%d", &n);
        for (int i=0; i<n; i++)
            cin>>a[i].name>>a[i].sc;
        if(n == 1){
            cout<<a[0].sc<<endl;
            continue;
        }
        sort (a, a+n, cmp);
        int sum = a[0].sc + a[1].sc;
        for (int i=2; i<n; i++){
            if (a[i].name != a[i-2].name)
                sum += a[i].sc;
        }
        cout<<sum<<endl;
    }
    return 0;
}