#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 struct node {

     char f_name[],loc_name[];

     int n;

     friend bool operator < (node a,node b) {

         int len1 = strlen(a.loc_name);

         int len2 = strlen(b.loc_name);

         int M = max(len1,len2),i = ;

         while(i < M) {

             if(a.loc_name[i] != b.loc_name[i])

             return a.loc_name[i] < b.loc_name[i];

             i++;

         }

         len1 = strlen(a.f_name);

         len2 = strlen(b.f_name);

         M = max(len1,len2),i = ;

         while(i < M) {

             if(a.f_name[i] != b.f_name[i])

             return a.f_name[i] < b.f_name[i];

             i++;

         }

         return ;

     }

 };

 int main() {

     int T,N,flag = ;

     scanf("%d",&T);

     while(T--) {

         node M[];

         if(flag)

         puts("");

         flag = ;

         scanf("%d",&N);

         M[].f_name[] = M[].loc_name[] = M[N+].f_name[] = M[N+].loc_name[] = NULL;

         M[].n = M[N+].n = ;

         for(int i = ;i <= N;++i)

         scanf("%s%s%d",M[i].f_name,M[i].loc_name,&M[i].n);

         sort(M+,M+N+);

         for(int i = ;i <= N;++i) {

               if(strcmp(M[i].loc_name,M[i-].loc_name))

               printf("%s\n",M[i].loc_name);

               if(strcmp(M[i].loc_name,M[i+].loc_name) || strcmp(M[i].f_name,M[i+].f_name))

               printf("   |----%s(%d)\n",M[i].f_name,M[i].n);

               else M[i+].n += M[i].n;

         }

     }

     return ;

 }