#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
const int M = 2505;
struct cow{
    int p,s,c;
} b[M];

int n,m;
int a[N];

bool cmp(cow x,cow y){
    return x.c < y.c;
}

int main()
{
    freopen("Stacks.in","r",stdin);
    freopen("Stacks.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    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>>b[i].p>>b[i].s>>b[i].c;
        sort(b + 1,b + 1 + m,cmp);
        for(int i = 1;i <= n;i++){
            int ans = 0;
            for(int j = 1;j <= m;j++){
                if(a[i] >= b[j].p){
                    ans += (a[i] - b[j].p + 1)*b[j].c;
                    a[i] = b[j].p - 1;
                }
                if(!a[i]){
                    cout<<ans<<" ";
                    break;
                }
            }
        }
        cout<<endl;
    }
    return 0;
}