#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#include<vector>
#include<map>
#include<set>
using namespace std;
const int inf=(1<<30)-1;
const int maxn=100010;
#define REP(i,n) for(int i=(0);i<(n);i++)
#define FOR(i,j,n) for(int i=(j);i<=(n);i++)
typedef long long ll;
struct data{
    string s;
    int x;
    bool operator <(const data &b) const{
        return (s==b.s)?x>b.x:s<b.s;
    }
}a[maxn];
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        multimap<string,int> mp;
        ll ans=0;
        for(int i=1;i<=n;i++) cin>>a[i].s>>a[i].x;
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++)
        {
            if(mp.count(a[i].s)<2) mp.insert(make_pair(a[i].s,a[i].x)),ans+=a[i].x;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}