#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
struct edge {
  int u, v, w;
};
bool cmp(const edge &a, const edge &b) { return a.w < b.w; }
string to_s(int t) {
  stringstream ss;
  ss << t;
  return ss.str();
}
struct info {
  long long l, r, d;
};
long long n, m, k;
long long a[100010];
int main() {
  cin >> n >> m >> k;
  vector<info> v;
  long long q[100010];
  memset(q, 0, sizeof(q));
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) {
    info x;
    cin >> x.l >> x.r >> x.d;
    v.push_back(x);
  }
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    q[x]++;
    q[y + 1]--;
  }
  for (int i = 2; i <= m; i++) q[i] += q[i - 1];
  long long ans[100010];
  memset(ans, 0, sizeof(ans));
  for (int i = 1; i <= m; i++) {
    ans[v[i - 1].l] += (q[i] * v[i - 1].d);
    ans[v[i - 1].r + 1] -= (q[i] * v[i - 1].d);
  }
  for (int i = 1; i <= n; i++) ans[i] += ans[i - 1];
  for (int i = 1; i <= n; i++) cout << a[i] + ans[i] << " ";
}
