#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}


//defmodfact
const int COMinitMAX = 998244;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint cmb(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}
//--------


int main(){
	int n, k; cin >> n >> k;
	vector<vector<int>> ikeru(n, vector<int>(0));
	vector<int> deg(n);
	dsu uf(n);
	rep(i,0,n){
		int u, v; cin >> u >> v;
		u--; v--;
		ikeru[u].push_back(v);
		ikeru[v].push_back(u);
		deg[u]++;
		deg[v]++;
		uf.merge(u, v);
	}
	vector<int> tansaku(n);
	vector<bool> is_heiro(n, true);
	vector<int> mada = {};
	rep(i,0,n){
		if (deg[i] == 1){
			mada.push_back(i);
		}
	}
	while(!mada.empty()){
		int i = mada.back();
		mada.pop_back();
		is_heiro[i] = false;
		for (int j: ikeru[i]){
			deg[j]--;
			if (deg[j] == 1){
				mada.push_back(j);
			}
		}
	}
	vector<int> ks(n);
	rep(i,0,n){
		if (is_heiro[i]){
			ks[uf.leader(i)]++;
		}
	}

	mint ans = 1;
	rep(i,0,n){
		if (ks[i] >= 1){
			ans *= mint(k-1).pow(ks[i]) + mint(-1).pow(ks[i]) * mint(k-1);
		}
	}

	rep(i,0,n){
		if (is_heiro[i]){
			tansaku[i] = 1;
			mada.push_back(i);
		}
	}


	vector<mint> dp(n);
	while(!mada.empty()){
		int i = mada.back();
		mada.pop_back();
		for (int j: ikeru[i]){
			if (tansaku[j] == 1) continue;
			tansaku[j] = 1;
			ans *= k-1;
			mada.push_back(j);
		}
	}

	cout << ans.val() << '\n';

	
}