#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define inf (0x3f3f3f3f)
#define ls int len=s.size()
#define ls1 int len1=s1.size()
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%I64d",&x)
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=n-1;i>=0;i--)
typedef long long int LL;
typedef long long int ll;

#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include<stack>
void g(int t){if(t){g((t-1)/26);putchar(65+(t-1)%26);}}

struct node{
    char ch[20];
    int val;
    bool operator<(const node &d)const{
        return val>d.val;
    }
}d[10005];

map<string,int>mp;

int main()
{
#ifdef LOCAL
    freopen("data.h", "r", stdin);
    //freopen("1.h","w",stdout);
#endif
    int T;

    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++) memset(d[i].ch,0,sizeof(d[i].ch));
        for(int i=0;i<n;i++){
            getchar();
            scanf("%s %d",d[i].ch,&d[i].val);
        }
        sort(d,d+n);
        mp.clear();
        int sum=0;
        for(int i=0;i<n;i++){
            if(mp[d[i].ch]<2){
                mp[d[i].ch]++;
                sum+=d[i].val;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}