#include <bits/stdc++.h>
int T;
int n, m;
long long c[200010];
long long val[200010];
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++) scanf("%lld", &c[i]), val[i] = 0;
        for (int i = 1; i <= m; i++) {
            int d, w;
            scanf("%d%d", &d, &w);
            val[d] += w;
        }
        for (int i = 1, min = 1; i <= n; i++) {
            if (c[i] < c[min]) min = i;
            c[min] -= val[i];
        }
        std::sort(c + 1, c + n + 1);
        for (int i = 1; i <= n; i++) {
            c[i] += c[i - 1];
            printf("%lld ", c[i]);
        }
    }
}