#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 333;
const long long linf = 1e18 + inf;
int n, m, q;
vector<pair<int, int> > lca[13];
vector<int> sub[1 << 13];
int pop[1 << 13], stBit[1 << 13], ch[13], need[13], val[1 << 13], nb[1 << 13];
bool ok[13][1 << 13];
long long dp[13][1 << 13][2];
long long f(int dad, int mask, bool w) {
  if (!w) {
    int c = need[dad];
    if (c & (1 << dad)) c ^= 1 << dad;
    if ((mask & c) != c) return 0;
  }
  if (!mask) return 1;
  long long &r = dp[dad][mask][w];
  if (r != -1) return r;
  r = 0;
  for (__typeof((sub[mask]).begin()) it = (sub[mask]).begin();
       it != (sub[mask]).end(); it++) {
    int x = *it;
    if (!ok[dad][x]) continue;
    int c = ch[dad] & x;
    if (!c) {
      for (int i = 0; i < n; i++) {
        if (x & (1 << i)) {
          int m1 = x;
          int m2 = mask ^ x;
          if (!(nb[m1] & m2) and !(nb[m2] & m1))
            r += f(i, m1 ^ (1 << i), 0) * f(dad, m2, 1);
        }
      }
    } else if (c - (c & -c) == 0) {
      int i = val[c];
      int m1 = x;
      int m2 = mask ^ x;
      if (!(nb[m1] & m2) and !(nb[m2] & m1))
        r += f(i, m1 ^ (1 << i), 0) * f(dad, m2, 1);
    }
  }
  return r;
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--;
    y--;
    ch[x] |= 1 << y;
    ch[y] |= 1 << x;
  }
  for (int i = 1; i <= q; i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    a--;
    b--;
    c--;
    lca[c].push_back(pair<int, int>(a, b));
    need[c] |= 1 << a;
    need[c] |= 1 << b;
  }
  for (int i = 0; i < n; i++) {
    for (int x = 0; x < (1 << n); x++) {
      if (x & (1 << i)) continue;
      bool flag = 0;
      for (int j = 0; j < lca[i].size(); j++) {
        int a = lca[i][j].first;
        int b = lca[i][j].second;
        if ((x & (1 << a)) and (x & (1 << b))) {
          flag = 1;
          break;
        }
      }
      ok[i][x] = !flag;
    }
  }
  for (int i = 0; i < n; i++) {
    val[1 << i] = i;
  }
  for (int i = 1; i < (1 << n); i++) {
    nb[i] = nb[i - (i & -i)] | ch[val[i & -i]] | need[val[i & -i]];
    pop[i] = pop[i - (i & -i)] + 1;
    stBit[i] = i & -i;
    vector<int> v;
    for (int j = 0; j < n; j++) {
      if (i & (1 << j)) v.push_back(j);
    }
    for (int x = 0; x < (1 << v.size()); x++) {
      int res = 0;
      for (int j = 0; j < v.size(); j++) {
        if (x & (1 << j)) res |= 1 << v[j];
      }
      if (res & stBit[i]) sub[i].push_back(res);
    }
  }
  memset(dp, -1, sizeof(dp));
  printf("%lld\n", f(0, (1 << n) - 1 - 1, 0));
  return 0;
}
