#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e5+5, mod=1e9+7;
ll n, k, u, v, dp[nx], dpr[nx], lvl[nx], lcnt, res;
vector<int> d[nx];
void dfs(int u, int p)
{
lvl[u]=lvl[p]+1;
for (auto v:d[u]) if (v!=p) dfs(v, u), dp[u]|=!dp[v];
}
void dfs2(int u, int p)
{
lcnt+=!(dp[u]|dpr[u]);
//cout<<"debug "<<u<<' '<<dp[u]<<' '<<dpr[u]<<'\n';
int cnt=0;
for (auto v:d[u]) if (v!=p&&!dp[v]) cnt++;
for (auto v:d[u])
{
if (v==p) continue;
if (cnt-!dp[v]) dpr[v]=1;
dfs2(v, u);
}
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=1; i<n; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u);
dfs(1, 1);
dfs2(1, 1);
//cout<<"lcnt "<<lcnt<<'\n';
for (int i=1; i<=n; i++)
{
if (lvl[i]%2)
{
if (dp[i]) res=(res+n)%mod;
else res=(res+lcnt)%mod;
}
else
{
if (!dp[i]) res=(res+(n-lcnt))%mod;
}
//cout<<i<<' '<<res<<'\n';
}
cout<<res;
}
