#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int maxm = 1e9 + 7;
int n, m, k;
long long a[maxn];
int l[maxn], r[maxn];
long long v[maxn];
struct node {
  int pos;
  long long val;
  bool operator<(const node &a) const { return a.pos < pos; }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> k;
  int x, y, z;
  priority_queue<node> q, s;
  for (int i = (1); i <= (n); ++i) cin >> a[i];
  for (int i = (1); i <= (m); ++i) {
    cin >> l[i] >> r[i] >> v[i];
  }
  for (int i = (1); i <= (k); ++i) {
    cin >> x >> y;
    s.push({x, 1});
    s.push({y + 1, -1});
  }
  long long num = 0;
  for (int i = (1); i <= (m); ++i) {
    while (!s.empty() && s.top().pos == i) {
      num += s.top().val;
      s.pop();
    }
    q.push({l[i], num * v[i]});
    q.push({r[i] + 1, (-1) * num * v[i]});
  }
  long long add = 0;
  for (int i = (1); i <= (n); ++i) {
    while (!q.empty() && q.top().pos == i) {
      add += q.top().val;
      q.pop();
    }
    a[i] += add;
  }
  for (int i = (1); i <= (n); ++i) cout << a[i] << " ";
}
