#include<bits/stdc++.h>
using namespace std;
const int N=200005;
int t,n,m;
int a[N];
int ord[N];
#define ll long long
const ll inf=1e15;
ll f[N],g[N],sum[N];
bool cmp(int x,int y)
{
    return a[x]<a[y];
}
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&m);
        for (int i=1;i<=n;++i)
        {
            scanf("%d",&a[i]);
            ord[i]=i;
            f[i]=0;
        }
        sort(ord+1,ord+1+n,cmp);
        int mn=n+1;
        for (int i=1,r,w;i<=m;++i)
        {
            scanf("%d%d",&r,&w);
            f[r]+=w;
        }
        for (int i=1;i<=n;++i)
            sum[i]=sum[i-1]+a[ord[i]];
        for (int i=n-1;i;--i)
            f[i]+=f[i+1];
        for (int i=1;i<=n;++i)
        {
            g[i]=a[i]-f[i];
            g[i]=min(g[i],g[i-1]);
        }

        for (int i=1;i<=n;++i)
        {
            int _mn=min(mn,ord[i]);
            printf("%lld%c",min(mn==1?inf:sum[i-1]+g[mn-1],sum[i]-f[_mn]),(i==n?'\n':' '));
            mn=_mn;
        }
    }
    return 0;
}