不对啊

#include <bits/stdc++.h>
using namespace std;
int N,M,Dis[10000];
int Book[10000];
vector <pair<int,int> >G[10000];
queue <int> Q; 
int main(){
    int s;
	cin>>N>>M>>s;
	for (int i=1;i<=N;i++) Dis[i]=1e9;
	for (int i=1;i<=M;i++){
		int u,v,w;
		cin>>u>>v>>w;
		G[u].push_back(make_pair(v,w));
		G[v].push_back(make_pair(u,w));
	}
	Q.push(1);
	Dis[1]=0; 
	Book[1]=1;
	while (!Q.empty()){ 
		int t=Q.front();
		Q.pop();
		Book[t]=0;
		for (int i=0;i<G[t].size();i++){
			int v=G[t][i].first;
			int w=G[t][i].second; 
			if (Dis[t]+w<Dis[v]){
				Dis[v]=Dis[t]+w;
				if (Book[v]==0) Q.push(v);
			}
		}
	}
	for (int i=1;i<=N;i++) cout<<Dis[i]<<" ";
}