#include <bits/stdc++.h>
using namespace std;
struct Edge {
  long long from, to, cap, flow, index;
  Edge(int from, int to, long long cap, long long flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct PushRelabel {
  int N;
  vector<vector<Edge>> G;
  vector<int> dist, active, count;
  vector<long long> excess;
  queue<int> Q;
  PushRelabel(int N)
      : N(N), G(N), excess(N), dist(N), active(N), count(2 * N) {}
  void AddEdge(int from, int to, long long cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  void Enqueue(int v) {
    if (!active[v] && excess[v] > 0) {
      active[v] = true;
      Q.push(v);
    }
  }
  void Push(Edge &e) {
    long long amt = min(excess[e.from], e.cap - e.flow);
    if (dist[e.from] <= dist[e.to] || amt == 0) return;
    e.flow += amt;
    G[e.to][e.index].flow -= amt;
    excess[e.to] += amt;
    excess[e.from] -= amt;
    Enqueue(e.to);
  }
  void Gap(int k) {
    for (int v = 0; v < N; v++) {
      if (dist[v] < k) continue;
      count[dist[v]]--;
      dist[v] = max(dist[v], N + 1);
      count[dist[v]]++;
      Enqueue(v);
    }
  }
  void Relabel(int v) {
    count[dist[v]]--;
    dist[v] = 2 * N;
    for (int i = 0; i < G[v].size(); i++)
      if (G[v][i].cap - G[v][i].flow > 0)
        dist[v] = min(dist[v], dist[G[v][i].to] + 1);
    count[dist[v]]++;
    Enqueue(v);
  }
  void Discharge(int v) {
    for (int i = 0; excess[v] > 0 && i < G[v].size(); i++) Push(G[v][i]);
    if (excess[v] > 0) {
      if (count[dist[v]] == 1)
        Gap(dist[v]);
      else
        Relabel(v);
    }
  }
  long long GetMaxFlow(int s, int t) {
    count[0] = N - 1;
    count[N] = 1;
    dist[s] = N;
    active[s] = active[t] = true;
    for (int i = 0; i < G[s].size(); i++) {
      excess[s] += G[s][i].cap;
      Push(G[s][i]);
    }
    while (!Q.empty()) {
      int v = Q.front();
      Q.pop();
      active[v] = false;
      Discharge(v);
    }
    long long totflow = 0;
    for (int i = 0; i < G[s].size(); i++) totflow += G[s][i].flow;
    return totflow;
  }
};
const int INF = 1e5;
long long dis[101][101], n, m, u, v, gold[101], po[101], go, vis[100005];
long long ans, tot[100005];
vector<pair<int, int>> bases[101];
long long xs[100005], a[100005], f[100005], p[100005];
long long xb[100005], d[100005], g[100005];
vector<pair<int, int>> ships;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (j != i) dis[i][j] = INF;
    }
  for (int i = 0; i < m; ++i) {
    cin >> u >> v;
    if (u != v) dis[u][v] = dis[v][u] = 1;
  }
  for (int b = 1; b <= n; ++b)
    for (int a = 1; a <= n; ++a)
      for (int c = 1; c <= n; ++c)
        dis[a][c] = min(dis[a][c], dis[a][b] + dis[b][c]);
  int s, b, k;
  cin >> s >> b >> k;
  for (int i = 0; i < s; ++i) {
    cin >> xs[i] >> a[i] >> f[i] >> p[i];
    ships.push_back(make_pair(a[i], i));
  }
  for (int i = 0; i < b; ++i) {
    cin >> xb[i] >> d[i] >> g[i];
    bases[xb[i]].push_back(make_pair(d[i], g[i]));
  }
  for (int i = 1; i <= n; ++i) sort(bases[i].begin(), bases[i].end());
  sort(ships.begin(), ships.end());
  for (int j = 1; j <= n; j++) gold[j] = -(1LL << 55);
  for (int i = 0; i < s; ++i) {
    for (int j = 1; j <= n; ++j)
      while (po[j] != (int)bases[j].size() &&
             bases[j][po[j]].first <= ships[i].first)
        gold[j] = max(gold[j], (long long)bases[j][po[j]++].second);
    go = -(1LL << 55);
    u = ships[i].second;
    for (int j = 1; j <= n; ++j)
      if (dis[j][xs[u]] < INF && dis[j][xs[u]] <= f[u]) {
        go = max(go, gold[j]);
      }
    tot[u] = go - p[u];
  }
  PushRelabel pr(s + 2);
  long long ls = 0;
  for (int i = 0; i < s; i++) {
    if (tot[i] > 0)
      ls += tot[i], pr.AddEdge(0, i + 2, tot[i]);
    else
      pr.AddEdge(i + 2, 1, -tot[i]);
  }
  for (int i = 0; i < k; ++i) {
    cin >> u >> v, u--, v--;
    pr.AddEdge(u + 2, v + 2, (1LL << 55));
  }
  ls -= pr.GetMaxFlow(0, 1);
  cout << ls << "\n";
}
