#include <map>
#include <ctime>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <string>
#include <queue>
typedef unsigned int TYPE;
inline int input() {
    static int c,t;static int k;k=0;t=1;
    do c=getchar(); while((c<'0'||c>'9')&&c!='-');
    if(c=='-')c=getchar(),t=-1;
    do k=k*10+c-'0',c=getchar(); while(c>='0'&&c<='9');
    return k*t;
}

int main() {
    int T;
    std::cin>>T;
    while(T-->0) {
        std::map<std::string,std::priority_queue<int> >ma;
        int N;std::cin>>N;
        for(int i=1;i<=N;++i) {
            std::string s;
            std::cin>>s;
            int k;
            std::cin>>k;
            ma[s].push(k);
        }
        int ans=0;
        for(std::map<std::string,std::priority_queue<int> >::iterator it=ma.begin();it!=ma.end();++it) {
            for(int i=0;!it->second.empty()&&i<2;++i) {
                ans+=it->second.top();
                it->second.pop();
            }
        }printf("%d\n",ans);
    }
    return 0;
}