#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> X, Y;
vector<int> U, V;

vector<vector<int>> tree;
vector<int> us;
void dfs(int u, int p) {
  auto it = find(tree[u].begin(), tree[u].end(), p);
  if (it != tree[u].end()) tree[u].erase(it);
  for (const int v : tree[u]) dfs(v, u);
  us.push_back(u);
}

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

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    X.resize(M);
    Y.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &X[i], &Y[i]);
      --X[i];
      --Y[i];
    }
    U.resize(N - 1);
    V.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &U[i], &V[i]);
      --U[i];
      --V[i];
    }
    
    tree.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      tree[U[i]].push_back(V[i]);
      tree[V[i]].push_back(U[i]);
    }
    us.clear();
    dfs(0, -1);
    
    memset(adjG, 0, sizeof(adjG));
    for (int i = 0; i < M; ++i) {
      adjG[X[i]][Y[i]] = true;
      adjG[Y[i]][X[i]] = true;
    }
    
    Int ans = 0;
    for (int h = 0; h < 1 << N; ++h) {
      // hom, ban h
      vector<int> xs;
      for (int x = 0; x < N; ++x) if (!(h >> x & 1)) xs.push_back(x);
      memset(dp, 0, sizeof(dp));
      for (const int u : us) {
        for (const int x : xs) {
          dp[u][x] = 1;
          for (const int v : tree[u]) {
            Int sum = 0;
            for (const int y : xs) if (adjG[x][y]) sum += dp[v][y];
            dp[u][x] *= sum;
          }
        }
      }
      Int here = 0;
      for (const int x : xs) here += dp[0][x];
      ans += (__builtin_parity(h)?-1:+1) * here;
    }
    printf("%lld\n", ans);
  }
  return 0;
}