#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <stack>
#include <ctime>
using namespace std;


struct chang
{
    string str;
    int val;
}a[105];

bool cmp(struct chang a, struct chang b)
{
    if(a.str == b.str)
        return a.val>b.val;
    return a.str<b.str;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        for(int i = 0; i<n; i++)
        {
            cin >> a[i].str >> a[i].val;
        }
        sort(a, a+n, cmp);
        int cnt = 0;
        int sum = a[0].val;
        for(int i = 1; i<n; i++)
        {
            if(a[i].str == a[i-1].str)
                cnt++;
            else
                cnt = 0;
            if(cnt>1)
                continue;
            sum = sum+a[i].val;
        }
        printf("%d\n",sum);
    }

    return 0;
}