#include <bits/stdc++.h>

using namespace std;
#define x first 
#define y second

const int N=1e5+10;

int n;
int a[N];

void solve(int W)
{
    int n;
    cin >> n;
    map<pair<string,string>,int> Hash;
    unordered_map<string,int> Hash2;
    unordered_map<int,string> Hash3;
    vector<int> T(1e6);
    
    int u=0;
    for(int i=0;i<n;i++) {
        string s1,s2,s3;
        cin >> s1 >> s2 >> s3;
        // cout << "s:" << s1 << " " << s2 << " " << s3 << endl;
        if(s3=="accepted") {
            if(!Hash2.count(s2)) {
                Hash2[s2]=u;
                Hash3[u]=s2;
                Hash[{s1,s2}]=1;
                T[u]=1;
                u++;
            }else {
                int t=Hash2[s2];
                if(!Hash.count({s1,s2})) {
                    Hash[{s1,s2}]=1;
                    T[t]++;
                }else {

                }
            }
        }
    }
    int max_v=0;
    for(int i=0;i<u;i++) {
        // cout << "T:" << T[i] << endl;
        max_v=max(max_v,T[i]);
    }
    char ans='Z';
    for(int i=0;i<u;i++) {
        if(T[i]==max_v) {
            char c=Hash3[i][0];
            if(c<ans) {
                ans=c;
            }
        }
    }
    if(W==1) cout << ans << endl;
    else cout << ans;
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        solve(T);
    }

    return 0;
}