#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr int inf=numeric_limits<int>::max() / 2;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k;cin>>n>>k;
	vector<veci> g(n);
	veci deg(n, 0);
	rep(i, n){
		int a, b;cin>>a>>b;
		a--, b--;
		deg[a]++;
		deg[b]++;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	queue<int> q;
	rep(i, n) if(deg[i] == 1) q.push(i);
	veci cycle(n, 1);
	while(q.size()){
		int v = q.front(); q.pop();
		cycle[v] = 0;
		for(int nv : g[v]){
			deg[nv]--;
			if(deg[nv] == 1) q.push(nv);
		}
	}
	veci used(n, 0);
	int sz = 0;
	mint ans = 1;
	rep(i, n) if(cycle[i]){
		sz++;
		q.push(i);
		while(q.size()){
			int v = q.front(); q.pop();
			for(int nv : g[v]) if(cycle[nv] == 0 && used[nv] == 0){
				Log(nv);
				q.push(nv);
				ans *= k - 1;
				used[nv] = 1;
			}
		}
	}
	vector dp(sz + 1, vector<mint>(2, 0));
	dp[1][1] = k;
	rep(i, 1, sz - 1){
		dp[i + 1][0] = dp[i][0] * (k - 2) + dp[i][1] * (k - 1);
		dp[i + 1][1] = dp[i][0];
	}
	ans *= dp[sz - 1][0] * (k - 2) + dp[sz - 1][1] * (k - 1);
	cout<<ans<<endl;
}