#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
const long long mod = 998244353;
int mini[N], b[N], cb[N], d[N], cnt;
long long seg[N << 2], lazy[N << 2];
pair<pair<int, int>, int> mon[N];
pair<int, int> a[N];
void pushup(int pos) { seg[pos] = max(seg[pos << 1], seg[pos << 1 | 1]); }
void pushdown(int pos) {
  if (lazy[pos]) {
    seg[pos << 1] += lazy[pos];
    seg[pos << 1 | 1] += lazy[pos];
    lazy[pos << 1] += lazy[pos];
    lazy[pos << 1 | 1] += lazy[pos];
    lazy[pos] = 0;
  }
}
void build(int pos, int l, int r) {
  if (l == r) {
    seg[pos] = -mini[l];
    return;
  }
  int mid = l + r >> 1;
  build(pos << 1, l, mid);
  build(pos << 1 | 1, mid + 1, r);
  pushup(pos);
}
void upd(int pos, int L, int R, int l, int r, long long val) {
  if (L <= l && r <= R) {
    lazy[pos] += val;
    seg[pos] += val;
    return;
  }
  pushdown(pos);
  int mid = l + r >> 1;
  if (L <= mid) upd(pos << 1, L, R, l, mid, val);
  if (R > mid) upd(pos << 1 | 1, L, R, mid + 1, r, val);
  pushup(pos);
}
int main() {
  int n, m, p;
  scanf("%d%d%d", &n, &m, &p);
  for (int i = (0); i < (n); ++i) scanf("%d%d", &a[i].first, &a[i].second);
  for (int i = (1); i < (m + 1); ++i)
    scanf("%d%d", &b[i], &cb[i]), d[++cnt] = b[i];
  for (int i = (0); i < (p); ++i) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    mon[i] = {{x, y}, z};
  }
  sort(a, a + n);
  sort(mon, mon + p);
  sort(d + 1, d + 1 + cnt);
  cnt = unique(d + 1, d + 1 + cnt) - d - 1;
  for (int i = (1); i < (cnt + 1); ++i) mini[i] = 1e9;
  for (int i = (1); i < (m + 1); ++i)
    b[i] = lower_bound(d + 1, d + 1 + cnt, b[i]) - d,
    mini[b[i]] = min(mini[b[i]], cb[i]);
  build(1, 1, cnt);
  long long ans = -1e18;
  int num = 0;
  for (int i = (0); i < (n); ++i) {
    long long sum = -a[i].second;
    while (num < p && mon[num].first.first < a[i].first) {
      int pos = upper_bound(d + 1, d + 1 + cnt, mon[num].first.second) - d;
      if (pos <= cnt) upd(1, pos, cnt, 1, cnt, mon[num].second);
      ++num;
    }
    sum += seg[1];
    ans = max(sum, ans);
  }
  printf("%lld", ans);
}
