#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:167177216")
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long M = sqrt(100000 + 0.0) + 1;
  vector<long long> a(n, 0);
  vector<long long> p(M, 0);
  for (int i = 0; i < int(n); ++i) cin >> a[i];
  vector<long long> l(m), r(m), d(m);
  for (int i = 0; i < int(m); ++i) {
    cin >> l[i] >> r[i] >> d[i];
    l[i]--;
    r[i]--;
  }
  vector<pair<long long, long long> > v;
  for (int i = 0; i < int(k); ++i) {
    long long p, w;
    cin >> p >> w;
    p--, w--;
    v.push_back(make_pair(p, 0));
    v.push_back(make_pair(w, 1));
  }
  sort(v.begin(), v.end());
  long long q = 0, cnt = 0;
  for (int i = 0; i < m; ++i) {
    while (q < v.size() && v[q].first < i ||
           (v[q].first == i && v[q].second != 1)) {
      if (v[q].second == 0)
        cnt++;
      else
        cnt--;
      q++;
    }
    while (l[i] <= r[i]) {
      if (l[i] % M == 0 && l[i] + M <= r[i]) {
        p[l[i] / M] += cnt * d[i];
        l[i] += M;
      } else
        a[l[i]++] += cnt * d[i];
    }
  }
  for (int i = 0; i < int(n); ++i) printf("%I64d ", a[i] + p[i / M]);
  return 0;
}
