#include <cstdio>
#include <map>
#include <vector>
#include <algorithm>

int t;
int n;
char type[111][22];
int value[111];
std::map<long long,std::vector<int>> map;

int main(void)
{
    int i,j,k;
    int a,b,c;
    long long x;
    std::map<long long,std::vector<int> >::iterator it;

    //freopen("x.in","r",stdin);

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        map.clear();
        for(i = 0;i < n;++i)
        {
            scanf("%s %d",type + i,value + i);
            x = 0;
            for(j = 0;type[i][j];++j)
                (x *= 27) += type[i][j] - 'a' + 1;
            map[x].push_back(value[i]);
        }

        c = 0;
        for(it = map.begin();it != map.end();++it)
        {
            std::sort(it->second.begin(),it->second.end());
            for(k = it->second.size() - 1;k >= 0 && (k + 2 >= it->second.size());--k)
                c += it->second[k];
        }

        printf("%d\n",c);
    }

    return 0;
}