import java.util.Arrays;
import java.util.Scanner;
class ke implements Comparable<ke>{
    String op;
    int v;
    public ke(){}
    public ke(String op,int v){
        this.op = op;
        this.v = v;
    }
    @Override
    public int compareTo(ke p1) {
        // TODO Auto-generated method stub
        if(!this.op.equals(p1.op)){
            //System.out.println(op+" "+p1.op);
            return this.op.compareTo(p1.op);
        }
        else{
            //System.out.println("ddd");
            return p1.v-this.v;
        }
    }
}

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in=new Scanner(System.in);
        int t=in.nextInt();
        while(t-->0){
            int n=in.nextInt();
            ke []k=new ke[105];
            for(int i=0;i<105;i++) k[i]=new ke();
            for(int i=0;i<n;i++){
                k[i].op=in.next();
                k[i].v=in.nextInt();
            }
            Arrays.sort(k,0,n);
            
//            for(int i=0;i<n;i++){
//                System.out.println(k[i].op+" "+k[i].v);
//            }
            
            
            String last="";
            int ans=k[0].v;
            for(int i=1;i<n;i++){
                if(k[i].op.equals(last)){
                    //System.out.println("ddd");
                    continue;
                }
                else{
                    ans+=k[i].v;
                    last=k[i-1].op;
                }
            }
            System.out.println(ans);
        }
    }
}
/*
2
5
english 3
english 2
english 1
math 10
cook 100

2
6
A 1
A 2
A 3
A 4
A 5
A 6

*/