#include <bits/stdc++.h>
using namespace std;
long long MaxVal;
long long MaxOps;
long long tree[200010], ops[200010];
long long update(long long idx, long long val) {
  while (idx <= MaxVal) {
    tree[idx] += val;
    idx += idx & (-idx);
  }
  return 0;
}
long long query(long long idx) {
  long long sum = 0;
  while (idx > 0) {
    sum += tree[idx];
    idx -= idx & (-idx);
  }
  return sum;
}
long long updateOps(long long idx, long long val) {
  while (idx <= MaxOps) {
    ops[idx] += val;
    idx += idx & (-idx);
  }
  return 0;
}
long long queryOps(long long idx) {
  long long sum = 0;
  while (idx > 0) {
    sum += ops[idx];
    idx -= idx & (-idx);
  }
  return sum;
}
void solve(long long n) {
  long long i, j, k;
  long long m, val;
  cin >> m >> k;
  MaxVal = n;
  MaxOps = m;
  for (i = 1; i <= n; i++) {
    cin >> val;
    update(i, val);
    update(i + 1, -val);
  }
  vector<pair<long long, pair<long long, long long>>> v;
  long long x, y, vv;
  for (i = 1; i <= m; i++) {
    cin >> x >> y >> vv;
    v.emplace_back(vv, make_pair(x, y));
    updateOps(i, 1);
    updateOps(i, -1);
  }
  for (i = 0; i < k; i++) {
    cin >> x >> y;
    updateOps(x, +1);
    updateOps(y + 1, -1);
  }
  for (i = 0; i < v.size(); i++) {
    long long mult = queryOps(i + 1);
    update(v[i].second.first, mult * v[i].first);
    update(v[i].second.second + 1, -mult * v[i].first);
  }
  for (i = 1; i <= n; i++) {
    k = query(i);
    cout << k << " ";
  }
  cout << "\n";
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1, tc;
  long long n, m;
  while (cin >> n) {
    solve(n);
  }
  return 0;
}
