#include<bits/stdc++.h>
using namespace std;
int main()
{
    int T,n,t;
    char str[15];
    cin >> T;
    while(T--)
    {
        map <string, int> m;
        vector <int> v[105];
        int k = 0, sum = 0;
        cin >> n;
        for(int i = 0; i < n; i++)
        {
            scanf("%s%d", str, &t);
            if(m.find(str) == m.end())
                m[str] = k++;
            v[m[str]].push_back(t);
        }
        for(int i = 0; i < k; i++)
        {
            sort(v[i].begin(), v[i].end());
            sum += v[i][v[i].size() - 1];
            if(v[i].size() > 1)
                sum = sum + v[i][v[i].size() - 2];
        }
        cout << sum << endl;
    }
    return 0;
 }