#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxm = 100 + 10;
const int maxn = 3e5 + 10;
const int N = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const long long inf1 = 0x3f3f3f3f3f3f3f3f;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
                                       qu[55];
int f, qr;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char x) {
  *oS++ = x;
  if (oS == oT) flush();
}
template <typename A>
inline bool read(A &x) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (x = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    x = x * 10 + (c & 15);
  x *= f;
  return 1;
}
inline bool read(char &x) {
  while ((x = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                           (iS == iT ? EOF : *iS++))
                        : *iS++)) == ' ' ||
         x == '\n' || x == '\r')
    ;
  return x != EOF;
}
inline bool read(char *x) {
  while ((*x = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                            (iS == iT ? EOF : *iS++))
                         : *iS++)) == '\n' ||
         *x == ' ' || *x == '\r')
    ;
  if (*x == EOF) return 0;
  while (!(*x == '\n' || *x == ' ' || *x == '\r' || *x == EOF))
    *(++x) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                          (iS == iT ? EOF : *iS++))
                       : *iS++);
  *x = 0;
  return 1;
}
template <typename A, typename... B>
inline bool read(A &x, B &...y) {
  return read(x) && read(y...);
}
template <typename A>
inline bool write(A x) {
  if (!x) putc('0');
  if (x < 0) putc('-'), x = -x;
  while (x) qu[++qr] = x % 10 + '0', x /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(char x) {
  putc(x);
  return 0;
}
inline bool write(const char *x) {
  while (*x) {
    putc(*x);
    ++x;
  }
  return 0;
}
inline bool write(char *x) {
  while (*x) {
    putc(*x);
    ++x;
  }
  return 0;
}
template <typename A, typename... B>
inline bool write(A x, B... y) {
  return write(x) || write(y...);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher_;
}  // namespace io
using io ::putc;
using io ::read;
using io ::write;
int dis[maxm][maxm];
map<int, int> mp;
struct base {
  int def, gold, mmax;
  friend bool operator<(base a, base b) { return a.def < b.def; }
};
struct ship {
  int x, att, fuel, pri;
} a[N];
vector<base> v[maxm];
long long val[N];
int s, t;
int now[N], dep[N], head[N];
struct edge {
  int v;
  long long w;
  int nxt;
} e[maxn];
int ecnt;
void addedge(int u, int v, long long w) {
  e[ecnt] = {v, w, head[u]};
  head[u] = ecnt++;
  e[ecnt] = {u, 0, head[v]};
  head[v] = ecnt++;
}
int bfs() {
  queue<int> q;
  while (!q.empty()) q.pop();
  for (int i = s; i <= t; i++) {
    dep[i] = -1;
    now[i] = -1;
  }
  dep[s] = 0;
  q.push(s);
  now[s] = head[s];
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = head[u]; i != -1; i = e[i].nxt) {
      int v = e[i].v;
      if (e[i].w > 0 && dep[v] == -1) {
        dep[v] = dep[u] + 1;
        now[v] = head[v];
        q.push(v);
      }
    }
  }
  return dep[t] != -1;
}
long long dfs(int u, long long mi) {
  if (mi == 0 || u == t) return mi;
  long long tmp, sum = 0;
  for (int i = now[u]; i != -1 && mi; i = e[i].nxt) {
    now[u] = i;
    int v = e[i].v;
    if (e[i].w > 0 && dep[v] == dep[u] + 1) {
      tmp = dfs(v, min(mi, e[i].w));
      e[i].w -= tmp;
      e[i ^ 1].w += tmp;
      sum += tmp;
      mi -= tmp;
      if (!mi) break;
    }
  }
  return sum;
}
long long dinic() {
  long long ans = 0;
  while (bfs()) {
    ans += dfs(s, inf1);
  }
  return ans;
}
int main() {
  memset(head, -1, sizeof(head));
  memset(dis, 0x3f, sizeof(dis));
  int n, m;
  read(n, m);
  for (int i = 1; i <= n; i++) dis[i][i] = 0;
  for (int i = 1; i <= m; i++) {
    int u, v;
    read(u, v);
    dis[u][v] = dis[v][u] = 1;
  }
  for (int k = 1; k <= n; k++)
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++)
        dis[i][j] = min(dis[i][k] + dis[k][j], dis[i][j]);
  int snum, bnum, k;
  read(snum, bnum, k);
  for (int i = 1; i <= snum; i++) {
    int x, att, fu, pri;
    read(x, att, fu, pri);
    a[i] = {x, att, fu, pri};
  }
  for (int i = 1; i <= bnum; i++) {
    int x, def, gol;
    read(x, def, gol);
    v[x].push_back({def, gol, gol});
  }
  for (int i = 1; i <= n; i++) {
    sort(v[i].begin(), v[i].end());
    for (int j = 1; j < v[i].size(); j++)
      v[i][j].mmax = max(v[i][j].gold, v[i][j - 1].mmax);
  }
  for (int i = 1; i <= snum; i++) val[i] = -inf1;
  for (int i = 1; i <= snum; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[i].fuel >= dis[a[i].x][j]) {
        int l = 0, r = v[j].size() - 1, pos = -1;
        while (l <= r) {
          int mid = l + r >> 1;
          if (v[j][mid].def <= a[i].att) {
            l = mid + 1, pos = mid;
          } else
            r = mid - 1;
        }
        if (pos < 0) continue;
        val[i] = max(val[i], 0ll + v[j][pos].mmax - a[i].pri);
      }
    }
  }
  s = 0, t = snum + 1;
  for (int i = 1; i <= k; i++) {
    int u, v;
    read(u, v);
    addedge(u, v, inf1);
  }
  long long tot = 0;
  for (int i = 1; i <= snum; i++) {
    if (val[i] >= 0) {
      tot += val[i];
      addedge(s, i, val[i]);
    }
    if (val[i] < 0) addedge(i, t, -val[i]);
  }
  tot -= dinic();
  printf("%lld\n", tot);
  return 0;
}
