#include<bits/stdc++.h>
using namespace std;
typedef long long ll; 
const int N=5e5+10;
const int M=2510;
ll t,n,a[N],m;
struct node{
    ll p,s,c;
}w[M];
bool cmp(node x,node y){
    return x.c*y.s<y.c*x.s;
}
int solve(ll x){
    ll sum=0;
    for(int i=1;i<=m;i++){
        if(w[i].p>x){
            continue;
        }
        while(x>=w[i].p){
            sum+=w[i].c;
            if(x-w[i].s>=w[i].p){
                x-=w[i].s;
            }
            else{
                x=w[i].p-1;
            }
        }
    }
    if(x==0)return sum;
}
int main(){
    freopen("Stacks.in","r",stdin);
    freopen("Stacks.out","w",stdout);
    cin>>t;
    while(t--){
        cin>>n;
        for(int i=1;i<=n;i++)cin>>a[i];
        cin>>m;
        for(int i=1;i<=m;i++)cin>>w[i].p>>w[i].s>>w[i].c;
        sort(w+1,w+1+m,cmp);
        for(int i=1;i<=n;i++){
            cout<<solve(a[i])<<" ";
        }
        cout<<"\n";
    }
    return 0;
}
/*
1
1
10
4
101 1 1
1 4 8
9 3 5
15 2 3
*/