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

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main(){
  ll n,k;
  cin>>n>>k;
  vector<vector<ll>> G(n);
  vector<ll> in(n,0);
  for(ll i=0;i<n;i++){
    ll u,v;
    cin>>u>>v;
    u--;
    v--;
    G[u].push_back(v);
    G[v].push_back(u);
    in[u]++;
    in[v]++;
  }
  queue<ll> que;
  for(ll i=0;i<n;i++){
    if(in[i]==1){
      que.push(i);
    }
  }
  vector<bool> cy(n,true);
  while(que.size()){
    ll q=que.front();
    que.pop();
    in[q]--;
    cy[q]=false;
    for(ll u:G[q]){
      in[u]--;
      if(in[u]==1){
        que.push(u);
      }
    }
  }
  ll cycnt=0;
  vector<bool> seen(n);
  for(ll i=0;i<n;i++){
    seen[i]=cy[i];
    if(cy[i]){
      cycnt++;
    }
  }
  ll id=0;
  vector<vector<ll>> nc;
  for(ll i=0;i<n;i++){
    if(!seen[i]){
      id++;
      que.push(i);
      nc.resize(id);
      while(que.size()){
        ll q=que.front();
        que.pop();
        nc[id-1].push_back(q);
        for(ll u:G[q]){
          if(!seen[u]){
            seen[u]=true;
            que.push(u);
          }
        }
      }
    }
  }
  ll ans=0;
  ll mod=998244353;
  /*for(ll i=0;i<id;i++){
    sort(nc[i].begin(),nc[i].end());
    nc[i].erase(unique(nc[i].begin(),nc[i].end()),nc[i].end());
    ans+=modpow(k-1,(ll)nc[i].size(),mod);
    ans%=mod;
  }*/
  ans+=modpow(k-1,n-cycnt,mod);
  ans%=mod;
  vector<vector<ll>> dp(cycnt+1,vector<ll>(2,0));
  dp[1][1]=k;
  for(ll i=1;i<cycnt;i++){
    if(i==cycnt-1){
      dp[i+1][0]+=dp[i][1]*(k-1)%mod;
      dp[i+1][0]%=mod;
      dp[i+1][0]+=dp[i][0]*(k-2)%mod;
      dp[i+1][0]%=mod;
    }else{
      dp[i+1][0]+=dp[i][0]*(k-2);
      dp[i+1][0]%=mod;
      dp[i+1][0]+=dp[i][1]*(k-1);
      dp[i+1][0]%=mod;
      dp[i+1][1]+=dp[i][0];
      dp[i+1][1]%=mod;
    }
  }
  ans*=dp[cycnt][0];
  ans%=mod;
  cout<<ans<<endl;
}