int dijkstra(vector<pair<int,int>>g[N],int dist[N],int n,int k){
	dist[s]=0;
	for(int ird=0;rd<n;rd++){
		int cur=-1;
		for(int i=0;i<n;i++){
			if(!vis[i]&&(cur==-1||dist[i]<dist[cur]))cur=i;
		}
		for(auto [dst,weight]:g[car]){
			if(dist[dst]>weight+dist[cur]){
				dist[dst]=weight+dist[cur];
			}
		}
		vis[cur]=1;
	}
}