#include <bits/stdc++.h>
using namespace std;
inline char gc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool positive = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') positive = 0;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return positive ? x : -x;
}
inline void write(long long x) {
  if (x < 0) {
    x = -x;
    putchar('-');
  }
  if (x >= 10) write(x / 10);
  putchar('0' + x % 10);
}
inline void writeln(long long x) {
  write(x);
  puts("");
}
inline void writep(long long x) {
  write(x);
  putchar(' ');
}
inline unsigned long long rnd() {
  return ((unsigned long long)rand() << 30 ^ rand()) << 4 | rand() % 4;
}
const int N = 15, M = (1 << 13) + 5;
int n;
vector<long long> v[N];
vector<pair<int, int> > rv[N];
long long f[N][M];
bool used[N][M];
long long dfs(int u, int s) {
  if (~f[u][s]) return f[u][s];
  int pos = 0;
  long long res = 0;
  for (int i = (int)(0); i <= (int)(n - 1); i++)
    if ((s >> i & 1) && i != u) {
      pos = i;
      break;
    }
  for (int t = s; t; t = (t - 1) & s)
    if (t >> pos & 1) {
      if ((t >> u & 1) || used[u][t]) continue;
      int jb = -1, cnt = 0;
      for (auto k : v[u]) {
        if (t >> k & 1) cnt++, jb = k;
      }
      if (cnt > 1) continue;
      bool d = 1;
      for (int i = (int)(0); i <= (int)(n - 1); i++)
        if ((t >> i & 1) && i != jb) {
          for (auto k : v[i])
            if (!(t >> k & 1)) d = 0;
        }
      for (auto x : rv[u]) {
        if ((t >> x.first & 1) && (t >> x.second & 1)) d = 0;
      }
      if (!d) continue;
      if (~jb) {
        if (used[jb][t]) res += dfs(u, s ^ t) * dfs(jb, t);
      } else {
        for (int i = (int)(0); i <= (int)(n - 1); i++)
          if (used[i][t]) {
            res += dfs(u, s ^ t) * dfs(i, t);
          }
      }
    }
  return f[u][s] = res;
}
int main() {
  n = read();
  int m = read(), k = read();
  for (int i = (int)(1); i <= (int)(m); i++) {
    int x = read() - 1, y = read() - 1;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (int i = (int)(1); i <= (int)(k); i++) {
    int x = read() - 1, y = read() - 1, z = read() - 1;
    rv[z].push_back(make_pair(x, y));
  }
  memset(f, -1, sizeof(f));
  for (int i = (int)(0); i <= (int)(n - 1); i++) f[i][1 << i] = 1;
  for (int i = (int)(0); i <= (int)(n - 1); i++) {
    for (int s = (int)(0); s <= (int)((1 << n) - 1); s++)
      if (s >> i & 1) {
        used[i][s] = 1;
        for (auto x : rv[i]) {
          if (!(s >> x.first & 1) || !(s >> x.second & 1)) used[i][s] = 0;
        }
      }
  }
  cout << dfs(0, (1 << n) - 1);
}
