//#define dxx
#ifdef dxx
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dex(a) dbg(#a"=%lld onL%d infun %s\n",(ll)a,__LINE__,__FUNCTION__)
#include<cstdlib>
#define pause sys##tem("read -p \"press to continue\"")
#define _GLIBCXX_DEBUG
#endif

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>

using ll=long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

namespace bit{
    ll tr[200005];
    void add(int i,ll x,int n){
        for(;i<=n;i+=i&-i) tr[i]+=x;
    }ll que(int i){
        ll ans=0;
        for(;i;i-=i&-i) ans+=tr[i];
        return ans;
    }
}

namespace xm{
    std::vector<int> a;
    int oa[200005];
    void _(){
        int N,K;

        scanf("%d%d",&N,&K);
        a.clear();
        memset(bit::tr+1,0,sizeof*bit::tr*N);
        for(int i=1;i<=N;++i){
            scanf("%d",oa+i);
            bit::add(i,oa[i]-oa[i-1],N);
        }
        while(K--){
            int p,x;
            scanf("%d%d",&p,&x);
            bit::add(1,-x,N);
            bit::add(p+1,x,N);
        }

        ll ans0=1ll<<61;
        int ansp;
        for(int i=1;i<=N;++i){
            ll thisv=bit::que(i);
            if(thisv<ans0){
                ans0=thisv;
                ansp=i;
            }
        }
        printf("%lld",ans0);
        for(int i=1;i<=N;++i) if(i!=ansp) a.push_back(oa[i]);
        std::sort(a.begin(),a.end());
        for(int x:a) printf(" %lld",ans0+=x);
        putchar(10);
    }
}

int main(){
    int t;
    scanf("%d",&t);
    while(t--) xm::_();
    return 0;
}