void dfs(int cur, int fa)
{
    for (int i = 0; i < vec[cur].size(); i++)
    {
        int tar = vec[cur][i];
        if (tar == fa)
            continue;
        dfs(tar, cur);
        f[cur][0] = (f[cur][0] * (f[tar][0] + m * f[tar][1] % mod)) % mod;
        f[cur][1] = (f[cur][1] * (f[tar][0] + (m - 1) * f[tar][1] % mod)) % mod;
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        vec[u].push_back(v);
        vec[v].push_back(u);
    }
    for (int i = 1; i <= n; i++)
        f[i][0] = f[i][1] = 1;
    dfs(1, 0);
    cout << (f[1][0] + m * f[1][1] % mod) % mod;
    return 0;
}