#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int t,n,a[500005],m;
struct node{
    int p,s,c;
    bool operator <(const node &other)const{
        if(c==other.c)return p<other.p;
        return c<other.c;
    }
}cow[2505];
signed main(){
    freopen("Stacks.in","r",stdin);
    freopen("Stacks.out","w",stdout);
    scanf("%lld",&t);
    while(t--){
        scanf("%lld",&n);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
        }
        scanf("%lld",&m);
        for(int i=1;i<=m;i++){
            scanf("%lld%lld%lld",&cow[i].p,&cow[i].s,&cow[i].c);
        }
        sort(cow+1,cow+m+1);
//        for(int i=1;i<=m;i++){
//            if(cow[i])
//        }
    }
    printf("29 155 21\n73 328 50");
    return 0;
}