#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e5 + 1;
long long n, m, k, arr[MAX];
pair<long long, pair<long long, long long>> op[MAX];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  arr[0] = 0;
  for (long long i = 1; i <= m; i++) {
    long long l, r, d;
    cin >> l >> r >> d;
    op[i] = make_pair(d, make_pair(l, r));
  }
  vector<long long> freq(m + 1, 0);
  vector<long long> dp(m + 2, 0);
  for (long long i = 1; i <= k; i++) {
    long long l, r;
    cin >> l >> r;
    dp[l] = dp[l] + 1;
    dp[r + 1] = dp[r + 1] - 1;
  }
  long long sum = 0;
  for (long long i = 1; i <= m; i++) {
    sum += dp[i];
    freq[i] = sum;
  }
  vector<long long> dp2(n + 2, 0);
  for (long long i = 1; i <= n; i++) {
    dp2[i] = arr[i] - arr[i - 1];
  }
  for (long long i = 1; i <= m; i++) {
    long long val = op[i].first;
    long long l = op[i].second.first;
    long long r = op[i].second.second;
    dp2[l] = dp2[l] + val * freq[i];
    dp2[r + 1] = dp2[r + 1] - val * freq[i];
  }
  sum = 0;
  for (long long i = 1; i <= n; i++) {
    sum += dp2[i];
    arr[i] = sum;
    cout << arr[i] << " ";
  }
  cout << endl;
  return 0;
}
