#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const long long N = 3e5 + 5;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const int INFi = 0x7f7f7f7f;
long long test = 1, n, m, k, a[N], pre[N], pref[N], op[N][3];
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> op[i][0] >> op[i][1] >> op[i][2];
  while (k--) {
    int x, y;
    cin >> x >> y;
    pre[x]++, pre[y + 1]--;
  }
  for (int i = 1; i <= m; i++) {
    pre[i] += pre[i - 1];
    pref[op[i][0]] += pre[i] * op[i][2];
    pref[op[i][1] + 1] -= pre[i] * op[i][2];
  }
  for (int i = 1; i <= n; i++) {
    pref[i] += pref[i - 1];
    cout << pref[i] + a[i] << " ";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  for (int i = 1; i <= test; i++) {
    solve();
  }
}
