#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {return pow(modc-2);}
    mint& operator/=(const mint& a){ return (*this) *= a.inv();}
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{ return x == a.x;}
    bool operator != (const mint& a) const{ return x != a.x;}
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){ return x;}
};

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    //木の塗り方=(K-1)^N
    //円の塗り方=dp

    ll N, K, a, b, P;
    cin >> N >> K;
    P = N;
    vector<mint> pow(N+1);
    pow[0] = 1;
    for (int i=1; i<=N; i++) pow[i] = pow[i-1] * (K-1);
    vector<vector<ll>> E(N+1);
    vector<ll> deg(N+1);
    for (int i=1; i<=N; i++){
        cin >> a >> b;
        E[a].push_back(b);
        E[b].push_back(a);
        deg[a]++;
        deg[b]++;
    }

    queue<ll> que;
    vector<bool> is_cycle(N+1, 1);
    for (int i=1; i<=N; i++){
        if (deg[i] == 1){
            que.push(i);
            is_cycle[i] = 0;
        }
    }

    while (!que.empty()){
        ll from = que.front();
        que.pop();
        for (auto to : E[from]){
            if (is_cycle[to]){
                deg[to]--;
                if (deg[to] == 1){
                    que.push(to);
                    is_cycle[to] = 0;
                }
            }
        }
    }

    mint ans = 1;
    ll M=0;

    auto dfs=[&](auto self, int from, int p)->void{
        M++;
        for (auto to : E[from]){
            if (to == p) continue;
            self(self, to, from);
        }
    };

    //木の塗り方
    for (int i=1; i<=N; i++){
        if (is_cycle[i]){
            for (auto to : E[i]){
                if (!is_cycle[to]){
                    M = 0;
                    dfs(dfs, to, i);
                    ans *= pow[M];
                    P -= M;
                }
            }
        }
    }

    //円の塗り方
    vector dp(P+1, vector<mint>(2)); //dp(i, j): i番目の色を1番目の色と同じ色に塗るかどうか(j)
    dp[1][1] = 1;
    for (int i=2; i<=P; i++){
        dp[i][0] = dp[i-1][1] * (K-1) + dp[i-1][0] * (K-2);
        dp[i][1] = dp[i-1][0];
    }
    ans *= dp[P][0] * K;

    cout << ans << endl;

    return 0;
}