#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,L[100100],m,R[100010];
ll c[101000],su[101000],ans[101000];
ll val(int l,int r,int t){
    ll s=0;
    for(int j=1;j<=m;j++)if(l<=L[j]&&L[j]<=t&&t<=R[j]&&R[j]<=r)s+=c[j];
    return s-(su[r]-su[l-1]);
}
void cdq(int l,int r,int xl,int xr,int yl,int yr){
    if(l>r)return;
    int mi=(l+r)>>1,X,Y;
    ll mx=-1e18;
    for(int i=xl;i<=min(xr,mi);i++)for(int j=max(yl,mi);j<=yr;j++)
        if(mx<val(i,j,mi))
            mx=val(i,j,mi),X=i,Y=j;
    ans[mi]=max(mx,0ll);
    cdq(l,mi-1,xl,xr,yl,yr);
    cdq(mi+1,r,xl,xr,yl,yr);
}
ll cf[101000];
void sol(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%lld",&su[i]),su[i]+=su[i-1],cf[i]=0;
    for(int i=1;i<=m;i++)scanf("%d%d%lld",&L[i],&R[i],&c[i]),cf[L[i]]+=c[i],cf[R[i]+1]-=c[i];
    cdq(1,n,1,n,1,n);
    for(int i=1;i<=n;i++)cf[i]+=cf[i-1],printf("%lld ",cf[i]-ans[i]);
    puts("");
}
int main(){
    int T;scanf("%d",&T);while(T--)sol();
    return 0;
}