#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 10007;

int tot, bel[N], spv[N], f[N], g[N];

bool sp[N];

vector<int> sta[N];

vector<pii> e[N];

void dfs(int u) { // {min(all), min(spv is selected)}
    for (auto [x, y] : e[u]) dfs(bel[y]);
    f[u] = g[u] = INT_MAX;
    for (auto s : sta[u]) {
        int cst = __builtin_popcount(s);
        for (auto [x, y] : e[u]) {
            cst += (((s >> x) & 1) ? f[bel[y]] : g[bel[y]]);
        }
        if (u == 1) f[u] = min(f[u], cst);
        else {
            f[u] = min(f[u], cst);
            if ((s >> spv[u]) & 1) g[u] = min(g[u], cst);
        }
    }
}

void add_block(int n, int m, int w) {
    int cur = ++tot;
    e[cur].clear();
    sta[cur].clear();
    vector<int> V;
    vector<pii> E;
    rep(i, 1, m) {
        int u, v;
        cin >> u >> v;
        bel[u] = bel[v] = cur;
        V.eb(u); V.eb(v); E.eb(u, v);
    }
    sort(all(V));
    V.erase(unique(all(V)), V.end());
    auto getpos = [&](int w) {
        return lower_bound(all(V), w) - V.begin();
    };
    auto ok = [&](int S) {
        for (auto [u, v] : E) {
            u = getpos(u); v = getpos(v);
            if (!((S >> u) & 1) && !((S >> v) & 1)) return false;
        }
        return true;
    };
    rep(S, 0, (1 << V.size()) - 1) if (ok(S)) sta[cur].eb(S);
    for (auto p : V) if (sp[p]) spv[cur] = getpos(p);
    rep(i, 1, w) {
        int u, v;
        cin >> u >> v;
        u = getpos(u);
        e[cur].eb(u, v);
        int nn, mm, ww;
        cin >> nn >> mm >> ww;
        add_block(nn, mm, ww);
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m, w;
    while (cin >> n >> m >> w) {
        tot = 0;
        memset(bel, 0, sizeof(bel));
        memset(sp, 0, sizeof(sp));
        add_block(n, m, w);
        dfs(1);
        printf("%d\n", f[1]);
    }
    return 0;
}