#include <bits/stdc++.h>
using namespace std;
long long a[100002], t[100002], y[100002], z[100002], f[100002];
pair<long long, pair<long long, long long> > lr[100002];
pair<long long, long long> x[100002];
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < m; i++)
    cin >> lr[i].first >> lr[i].second.first >> lr[i].second.second;
  for (int i = 0; i < k; i++) cin >> x[i].first >> x[i].second;
  sort(x, x + k);
  for (int i = 0; i < k; i++) {
    y[x[i].first - 1]++;
    y[x[i].second]--;
  }
  for (int i = 0; i < m; i++)
    if (i == 0)
      t[i] = y[i];
    else
      t[i] = t[i - 1] + y[i];
  for (int i = 0; i < m; i++) lr[i].second.second *= t[i];
  sort(lr, lr + m);
  for (int i = 0; i < m; i++) {
    z[lr[i].first - 1] += lr[i].second.second;
    z[lr[i].second.first] -= lr[i].second.second;
  }
  for (int i = 0; i < n; i++)
    if (i == 0)
      f[i] = z[i];
    else
      f[i] = f[i - 1] + z[i];
  for (int i = 0; i < n; i++) a[i] += f[i];
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
