#include <bits/stdc++.h>
using namespace std;
long long a[100001], b[100001];
int main() {
  int n, m, t;
  cin >> n >> m >> t;
  int c[n + 1], l[m + 1], r[m + 1], k[m + 1], p, q;
  for (int i = 1; i <= n; i++) {
    cin >> c[i];
  }
  for (int i = 1; i <= m; i++) {
    cin >> l[i] >> r[i] >> k[i];
  }
  for (int i = 1; i <= t; i++) {
    cin >> p >> q;
    b[p]++;
    if (q != m) b[q + 1]--;
  }
  for (int i = 2; i <= m; i++) {
    b[i] += b[i - 1];
  }
  for (int i = 1; i <= m; i++) {
    a[l[i]] += b[i] * k[i];
    a[r[i] + 1] -= b[i] * k[i];
  }
  for (int i = 2; i <= n; i++) {
    a[i] += a[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    cout << c[i] + a[i] << " ";
  }
  return 0;
}
