91pts RE求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second

const int maxn=10005;
const int inf=0x3f3f3f3f3f3f3f3f;

signed main(){
	int n,m,k,s,t;
	cin>>n>>m>>k>>s>>t;
	
	vector<pii> g[maxn*10];
	
	for(int i=0;i<m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		for(int j=0;j<=k;j++){
			g[u+j*n].push_back(make_pair(w,v+j*n));
			g[v+j*n].push_back(make_pair(w,u+j*n));
		}
		for(int j=0;j<k;j++){
			g[u+j*n].push_back(make_pair(0,v+(j+1)*n));
			g[v+j*n].push_back(make_pair(0,u+(j+1)*n));
		}
	}
	
		
	int dis[maxn*10];
	memset(dis,0x3f,sizeof(dis));
	dis[s]=0;
	priority_queue<pii,vector<pii>,greater<pii> > q;
	q.push(make_pair(0,s));
	
	while(!q.empty()){
		int x=q.top().se;
		int curd=q.top().fi;
		q.pop();
		if(curd>dis[x])continue;
		
		for(auto nx:g[x]){
			int to=nx.se;
			int cost=nx.fi;
			if(dis[to]>dis[x]+cost){
				dis[to]=dis[x]+cost;
				q.push(make_pair(dis[to],to));
			}
		}
	}
	
	int ans=inf;
	for(int i=0;i<=k;i++){
		ans=min(ans,dis[t+i*n]);
	}
	cout<<ans;
	return 0;
}