#include <bits/stdc++.h>

 using namespace std;

 int f[][], deep[];

 vector <int> v[];

 int n, k, x, y;

 long long ans;

 void dfs(int x, int fa, int dep){

     int c[];

     deep[x] = dep;

     for (auto u : v[x]){

         if (u == fa) continue;

         dfs(u, x, dep + );

         memset(c, , sizeof c); c[] = ;

         for (int i = ; i <= k; ++i) c[i + ] = f[u][i];

         for (int i = ; i <= k - ; ++i) ans += (long long)f[x][i] * c[k - i];

         for (int i = ; i <= k; ++i) f[x][i] += c[i];

     }

 }

 int main(){

     ans = ;

     scanf("%d%d", &n, &k);

     for (int i = ; i <= n - ; ++i){

         scanf("%d%d", &x, &y);

         v[x].push_back(y);

         v[y].push_back(x);

     }

     memset(deep, , sizeof deep);

     dfs(, , );

     for (int i = ; i <= n; ++i) if (deep[i] >= k) ++ans;

     printf("%lld\n", ans);

     return ;

 }