#include <bits/stdc++.h>
using namespace std;
const int N = 111111;
int queries[N];
int l[N];
int r[N];
long long v[N];
long long st[4 * N];
int qt[4 * N];
int lazy1[4 * N];
long long arr[N];
long long lazy[4 * N];
int n, m, k;
void build2(int p = 1, int l = 1, int r = n) {
  if (l == r) {
    st[p] = arr[l];
    return;
  }
  int mid = (l + r) >> 1;
  build2(p << 1, l, mid);
  build2(p << 1 | 1, mid + 1, r);
  st[p] = st[p << 1] + st[p << 1 | 1];
}
void push1(int p, int l, int r) {
  if (lazy1[p]) {
    qt[p] += lazy1[p] * (r - l + 1);
    if (r != l) {
      lazy1[p << 1] += lazy1[p];
      lazy1[p << 1 | 1] += lazy1[p];
    }
    lazy1[p] = 0;
  }
}
void push(int p, int l, int r) {
  if (lazy[p]) {
    st[p] += lazy[p] * (r - l + 1);
    if (r != l) {
      lazy[p << 1] += lazy[p];
      lazy[p << 1 | 1] += lazy[p];
    }
    lazy[p] = 0;
  }
}
void update1(int i, int j, int p = 1, int l = 1, int r = m) {
  push1(p, l, r);
  if (i > r || l > j) {
    return;
  }
  if (i <= l && r <= j) {
    lazy1[p] += 1;
    push1(p, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  update1(i, j, p << 1, l, mid);
  update1(i, j, p << 1 | 1, mid + 1, r);
  qt[p] = qt[p << 1] + qt[p << 1 | 1];
}
void update(int i, int j, long long val, int p = 1, int l = 1, int r = n) {
  push(p, l, r);
  if (i > r || l > j) {
    return;
  }
  if (i <= l && r <= j) {
    lazy[p] += val;
    push(p, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  update(i, j, val, p << 1, l, mid);
  update(i, j, val, p << 1 | 1, mid + 1, r);
  st[p] = st[p << 1] + st[p << 1 | 1];
}
long long query1(int i, int j, int p = 1, int l = 1, int r = m) {
  push1(p, l, r);
  if (i > r || l > j) {
    return 0;
  }
  if (i <= l && r <= j) {
    return qt[p];
  }
  int mid = (l + r) >> 1;
  return query1(i, j, p << 1, l, mid) + query1(i, j, p << 1 | 1, mid + 1, r);
}
long long query(int i, int j, int p = 1, int l = 1, int r = n) {
  push(p, l, r);
  if (i > r || l > j) {
    return 0;
  }
  if (i <= l && r <= j) {
    return st[p];
  }
  int mid = (l + r) >> 1;
  return query(i, j, p << 1, l, mid) + query(i, j, p << 1 | 1, mid + 1, r);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> arr[i];
  }
  build2();
  for (int i = 1; i <= m; ++i) {
    cin >> l[i] >> r[i] >> v[i];
  }
  for (int i = 1; i <= k; ++i) {
    int l, r;
    cin >> l >> r;
    update1(l, r);
  }
  for (int i = 1; i <= m; ++i) {
    update(l[i], r[i], v[i] * query1(i, i));
  }
  for (int i = 1; i <= n; ++i) {
    cout << query(i, i) << " ";
  }
  return 0;
}
