#include #include #define rep(i,n) for(int i=0;i vi; typedef vector vl; typedef vector> vvi; typedef vector> vvl; typedef long double ld; typedef pair P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const static_modint& a) {os << a.val(); return os;} template istream& operator>>(istream& is, vector& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template ostream& operator<<(ostream& os, const pair& p){os << p.first << ' ' << p.second << "\n"; return os;} template ostream& operator<<(ostream& os, const vector& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const vector>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} using mint = modint998244353; int main(){ int n, k; cin >> n >> k; vvi G(n); rep(i, n){ int u, v; cin >> u >> v; u--; v--; G[u].push_back(v); G[v].push_back(u); } int start = -1; int end = -1; vector p(n, -1); auto dfs = [&](int from, int prev, auto dfs) -> void{ for(int to : G[from]){ if(start != -1) continue; if(to == prev) continue; if(p[to] != -1){ start = from; end = to; return; } p[to] = from; dfs(to, from, dfs); } }; p[0] = -2; dfs(0, -1, dfs); // cout << p; // cout << start << ' ' << end << "\n"; vi loop; { int from = start; while(true){ loop.push_back(from); if(from == end) break; from = p[from]; } } // cout << loop; int m = loop.size(); mint ans = 1; vector same(m), dif(m); same[0] = k; rep(i, m - 1){ dif[i + 1] = same[i] * (k - 1) + dif[i] * (k - 2); same[i + 1] = dif[i]; } ans *= dif[m - 1]; ans *= mint(k - 1).pow(n - m); cout << ans; return 0; }