#include <bits/stdc++.h>
using namespace std;
const int maxn = 13;
int n, m, q;
int x[maxn], y[maxn];
bool g[maxn][maxn];
int lca[maxn][maxn];
int N;
int val[1 << maxn];
long long dp[1 << maxn][maxn];
int main() {
  memset(lca, -1, sizeof lca);
  for (int j = 1, i = 0; i < 13; i++, j += j) val[j] = i;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> q;
  for (int v, u, i = 0; i < m; i++) {
    cin >> x[i] >> y[i];
    x[i]--, y[i]--;
    g[x[i]][y[i]] = true;
    g[y[i]][x[i]] = true;
  }
  for (int v, u, d, i = 0; i < q; i++) {
    cin >> v >> u >> d;
    v--, u--, d--;
    if (lca[v][u] != -1 and lca[v][u] != d or (v == u and v != d)) {
      cout << 0 << endl;
      return 0;
    }
    lca[v][u] = d;
    lca[u][v] = d;
  }
  N = 1 << n;
  for (int i = 0; i < n; i++) dp[1 << i][i] = 1;
  for (int mask = 1; mask < N; mask++)
    for (int i = 0; i < n; i++)
      if (mask - (mask & -mask)) {
        int b = (mask - (1 << i)) & ((1 << i) - mask);
        for (int smask = mask, tmask; smask;
             smask = (smask - 1) & mask, tmask = mask - smask)
          if (smask & b and tmask & (1 << i))
            for (int j = 0; j < n; j++)
              if (smask & (1 << j)) {
                bool ok = true;
                for (int v, u, S = smask; S; S -= S & -S)
                  for (int T = tmask; T; T -= T & -T) {
                    v = val[S & -S];
                    u = val[T & -T];
                    if (lca[v][u] != -1 and lca[v][u] != i) ok = false;
                  }
                for (int v = 0; v < n; v++)
                  if (smask & (1 << v) and v != j and g[i][v]) ok = false;
                for (int e = 0; e < m; e++) {
                  if (smask & (1 << x[e]) and tmask & (1 << y[e]) and y[e] != i)
                    ok = false;
                  else if (smask & (1 << y[e]) and tmask & (1 << x[e]) and
                           x[e] != i)
                    ok = false;
                }
                if (ok) dp[mask][i] += dp[smask][j] * dp[mask - smask][i];
              }
      }
  cout << dp[N - 1][0] << endl;
  return 0;
}
