#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  std::vector<long long> arr(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    long long j;
    cin >> j;
    arr[i] = j;
  }
  std::vector<long long> start(100009, 0);
  std::vector<long long> end(100009, 0);
  std::vector<long long> value(100009, 0);
  for (int i = 1; i <= m; i++) {
    long long left, right, val;
    cin >> left >> right >> val;
    start[i] = left;
    end[i] = right;
    value[i] = val;
  }
  std::vector<long long> ans(100008, 0);
  for (int i = 1; i <= k; i++) {
    long long left, right;
    cin >> left >> right;
    ans[left]++;
    ans[right + 1]--;
  }
  for (int i = 1; i <= m; i++) {
    ans[i] += ans[i - 1];
    value[i] *= ans[i];
  }
  for (int i = 1; i <= 100005; i++) ans[i] = 0;
  for (int i = 1; i <= m; i++) {
    ans[start[i]] += value[i];
    ans[end[i] + 1] -= value[i];
  }
  for (int i = 1; i <= n; i++) {
    ans[i] += ans[i - 1];
    arr[i] += ans[i];
  }
  for (int i = 1; i <= n; i++) {
    cout << arr[i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int testCase;
  testCase = 1;
  while (testCase--) {
    solve();
  }
}
