#include <bits/stdc++.h>
using namespace std;
long long BIT[111111];
int n = 0;
int BIT_Modify(int r, long long delta) {
  for (int i = r; i > 0; i -= (i & (-i))) BIT[i] += delta;
  return 0;
}
long long BIT_Query(int x) {
  if (x <= 0) return 0;
  long long sum = 0;
  for (int i = x; i <= n; i += (i & (-i))) sum += BIT[i];
  return sum;
}
long long BIT2[111111];
int m = 0;
int BIT2_Modify(int r, long long delta) {
  for (int i = r; i > 0; i -= (i & (-i))) BIT2[i] += delta;
  return 0;
}
long long BIT2_Query(int x) {
  if (x <= 0) return 0;
  long long sum = 0;
  for (int i = x; i <= m; i += (i & (-i))) sum += BIT2[i];
  return sum;
}
int l[111111];
int r[111111];
int d[111111];
int main(void) {
  int k = 0;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    int x = 0;
    scanf("%d", &x);
    BIT_Modify(i, x);
    BIT_Modify(i - 1, -x);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d %d %d", &l[i], &r[i], &d[i]);
  }
  for (int i = 0; i < k; i++) {
    int x = 0;
    int y = 0;
    scanf("%d %d", &x, &y);
    BIT2_Modify(y, 1);
    BIT2_Modify(x - 1, -1);
  }
  for (int i = 1; i <= m; i++) {
    long long cnt = BIT2_Query(i);
    BIT_Modify(r[i], cnt * d[i]);
    BIT_Modify(l[i] - 1, -cnt * d[i]);
  }
  for (int i = 1; i <= n; i++) printf("%I64d ", BIT_Query(i));
  puts("");
  while (getchar() != EOF)
    ;
  return 0;
}
