#include <bits/stdc++.h>
using namespace std;
struct IO {
  char buf[(1 << 20)], *p1, *p2;
  char pbuf[(1 << 20)], *pp;
  IO() : p1(buf), p2(buf), pp(pbuf) {}
  inline char gc() {
    return getchar();
    if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, (1 << 20), stdin);
    return p1 == p2 ? ' ' : *p1++;
  }
  inline bool blank(char ch) {
    return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
  }
  template <class T>
  inline void read(T &x) {
    register double tmp = 1;
    register bool sign = 0;
    x = 0;
    register char ch = gc();
    for (; !(ch >= '0' && ch <= '9'); ch = gc())
      if (ch == '-') sign = 1;
    for (; (ch >= '0' && ch <= '9'); ch = gc()) x = x * 10 + (ch - '0');
    if (ch == '.')
      for (ch = gc(); (ch >= '0' && ch <= '9'); ch = gc())
        tmp /= 10.0, x += tmp * (ch - '0');
    if (sign) x = -x;
  }
  inline void read(char *s) {
    register char ch = gc();
    for (; blank(ch); ch = gc())
      ;
    for (; !blank(ch); ch = gc()) *s++ = ch;
    *s = 0;
  }
  inline void read(char &c) {
    for (c = gc(); blank(c); c = gc())
      ;
  }
  template <class t>
  inline void write(t x) {
    if (x < 0)
      putchar('-'), write(-x);
    else {
      if (x > 9) write(x / 10);
      putchar('0' + x % 10);
    }
  }
} io;
const long long mod = 1e9 + 7;
const long long mo = 998244353;
const long long N = 14;
const long long M = 105;
long long n, m, Lim, a[M], b[M], c[M];
long long ux[N], uy[N], exi[N][N], f[N][1 << N], ans;
inline bool ck(long long S, long long u) { return S & (1ll << u - 1); }
inline long long dfs(long long u, long long S) {
  if (~f[u][S]) return f[u][S];
  long long &dp = f[u][S];
  dp = 0;
  S ^= (1ll << u - 1);
  long long P = 0;
  for (long long i = (1); i <= (n); i++)
    if (ck(S, i)) {
      P = i;
      break;
    }
  for (long long T = S; T; T = (T - 1) & S)
    if (ck(T, P)) {
      long long fl = 0;
      for (long long i = (1); i <= (Lim); i++)
        if (c[i] == u && ck(T, a[i]) && ck(T, b[i])) {
          fl = 1;
          break;
        }
      if (fl) continue;
      for (long long i = (1); i <= (Lim); i++)
        if (ck(T, c[i]) && (!ck(T, a[i]) || !ck(T, b[i]))) {
          fl = 1;
          break;
        }
      if (fl) continue;
      for (long long i = (1); i <= (m); i++)
        if (ux[i] != u && uy[i] != u && (ck(T, ux[i]) ^ ck(T, uy[i]))) {
          fl = 1;
          break;
        }
      if (fl) continue;
      long long gs = 0, nxt = 0;
      for (long long i = (1); i <= (n); i++)
        if (exi[u][i] && ck(T, i) && i != u) gs++, nxt = i;
      if (gs > 1) continue;
      if (gs == 1)
        dp += dfs(nxt, T) * dfs(u, S ^ T ^ (1ll << u - 1));
      else
        for (long long i = (1); i <= (n); i++)
          if (ck(T, i)) dp += dfs(i, T) * dfs(u, S ^ T ^ (1ll << u - 1));
    }
  return dp;
}
signed main() {
  io.read(n), io.read(m), io.read(Lim);
  for (long long i = (1); i <= (m); i++)
    io.read(ux[i]), io.read(uy[i]), exi[ux[i]][uy[i]] = exi[uy[i]][ux[i]] = 1;
  for (long long i = (1); i <= (Lim); i++)
    io.read(a[i]), io.read(b[i]), io.read(c[i]);
  memset(f, -1, sizeof(f));
  for (long long i = (1); i <= (n); i++) f[i][1ll << i - 1] = 1;
  io.write(dfs(1, (1ll << n) - 1)), puts("");
  return 0;
}
