#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 2001;
const int maxm = 1000005;
int dist[maxn][maxn];
int tot, he[maxn], ne[maxm], ver[maxm];
void add(int x, int y) {
  ver[++tot] = y;
  ne[tot] = he[x];
  he[x] = tot;
}
int xs[maxn], xb[maxn], f[maxn];
long long a[maxn], d[maxn];
void floyd(int n) {
  for (int k = 1; k <= n; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
}
void init(int n) {
  memset(dist, 0x3f, sizeof(dist));
  for (int i = 1; i <= n; i++) dist[i][i] = 0;
  tot = 1;
}
int vis[maxn], match[maxn];
bool dfs(int x) {
  for (int cure = he[x]; cure; cure = ne[cure]) {
    int y = ver[cure];
    if (!vis[y]) {
      vis[y] = 1;
      if (!match[y] || dfs(match[y])) {
        match[y] = x;
        return true;
      }
    }
  }
  return false;
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  init(n);
  for (int x, y, i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    dist[x][y] = dist[y][x] = 1;
  }
  int s, b, k, h;
  scanf("%d%d%d%d", &s, &b, &k, &h);
  for (int i = 1; i <= s; i++) {
    scanf("%d%d%d", &xs[i], &a[i], &f[i]);
  }
  for (int i = 1; i <= b; i++) {
    scanf("%d%d", &xb[i], &d[i]);
  }
  floyd(n);
  for (int i = 1; i <= s; i++) {
    for (int j = 1; j <= b; j++) {
      if (dist[xs[i]][xb[j]] <= f[i] && a[i] >= d[j]) {
        add(i, j);
      }
    };
  }
  int ans = 0;
  for (int i = 1; i <= s; i++) {
    memset(vis, 0, sizeof(vis));
    if (dfs(i)) ans++;
  }
  long long res1 = (long long)s * h;
  long long res2 = (long long)ans * k;
  printf("%I64d\n", min(res1, res2));
  return 0;
}
