#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int MAX_N = 17;

int N, M;
vector<int> U, V;
vector<int> A, B;

int xss[MAX_N + 1][2];
bool cond[MAX_N][2];

bool adjG[MAX_N][MAX_N];
Int dp[1 << MAX_N][MAX_N][MAX_N];

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    U.resize(M);
    V.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &U[i], &V[i]);
      --U[i];
      --V[i];
    }
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    
    {
      vector<int> adjT(N, 0);
      for (int i = 0; i < N - 1; ++i) {
        adjT[A[i]] |= 1 << B[i];
        adjT[B[i]] |= 1 << A[i];
      }
      vector<int> adjTSum(1 << N, 0);
      for (int u = 0; u < N; ++u) {
        for (int h = 0; h < 1 << u; ++h) adjTSum[h | 1 << u] = adjTSum[h] | adjT[u];
      }
      vector<int> can(1 << N, 0);
      for (int h = 0; h < 1 << N; ++h) if (__builtin_popcount(adjTSum[h] & ~h) <= 2) can[h] = 1;
      vector<int> prv(1 << N, -1);
      prv[0] = -2;
      for (int h = 0; h < 1 << N; ++h) if (can[h] && ~prv[h]) {
        for (int u = 0; u < N; ++u) if (!(h & 1 << u)) prv[h | 1 << u] = u;
      }
      vector<int> us;
      for (int h = (1 << N) - 1; h; ) {
        const int u = prv[h];
        assert(~u);
        us.push_back(u);
        h ^= 1 << u;
      }
cerr<<us<<endl;
      memset(xss, ~0, sizeof(xss));
      memset(cond, 0, sizeof(cond));
      for (int k = 0; k <= N; ++k) {
        vector<int> xs;
        for (int x = 0; x < k; ++x) for (int y = k; y < N; ++y) if (adjT[us[x]] >> us[y] & 1) {
          xs.push_back(x);
        }
        sort(xs.begin(), xs.end());
        xs.erase(unique(xs.begin(), xs.end()), xs.end());
        const int xsLen = xs.size();
cerr<<k<<": "<<xs<<endl;
        assert(xsLen <= 2);
        for (int t = 0; t < xsLen; ++t) xss[k][t] = xs[t];
        if (k < N) {
          for (int t = 0; t < xsLen; ++t) if (adjT[us[xs[t]]] >> us[k] & 1) {
            cond[k][t] = true;
          }
        }
      }
    }
    
    memset(adjG, 0, sizeof(adjG));
    for (int i = 0; i < M; ++i) {
      adjG[U[i]][V[i]] = true;
      adjG[V[i]][U[i]] = true;
    }
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int k = 0; k < N; ++k) {
      for (int h = 0; h < 1 << N; ++h) if (__builtin_popcount(h) == k) {
        int usLen = 0;
        int us[MAX_N];
        for (int u = 0; u < N; ++u) if (u == 0 || (h & 1 << u)) us[usLen++] = u;
        for (int i = 0; i < usLen; ++i) for (int j = 0; j < usLen; ++j) {
          const int u = us[i];
          const int v = us[j];
          const int uu0 = (xss[k + 1][0] == xss[k][0]) ? u : (xss[k + 1][0] == xss[k][1]) ? v : (xss[k + 1][0] == k) ? -1 : 0;
          const int vv0 = (xss[k + 1][1] == xss[k][0]) ? u : (xss[k + 1][1] == xss[k][1]) ? v : (xss[k + 1][1] == k) ? -1 : 0;
          if (dp[h][u][v]) {
            for (int w = 0; w < N; ++w) if (!(h & 1 << w)) {
              if (cond[k][0] && !adjG[u][w]) continue;
              if (cond[k][1] && !adjG[v][w]) continue;
              const int uu = (~uu0) ? uu0 : w;
              const int vv = (~vv0) ? vv0 : w;
              dp[h | 1 << w][uu][vv] += dp[h][u][v];
            }
          }
        }
      }
    }
    Int ans = 0;
    for (int u = 0; u < N; ++u) for (int v = 0; v < N; ++v) {
      ans += dp[(1 << N) - 1][u][v];
    }
    printf("%lld\n", ans);
  }
  return 0;
}