为什么 WA 90？

#include<bits/stdc++.h>
#define int long long
using namespace std;
struct node{
	int to,w;
	bool operator>(const node&other)const{
		return w>other.w;
	}
};
int n,m,s,dist[10005];
vector<node>g[10005]; 
void dij(){
	priority_queue<node,vector<node>,greater<node> >pq;
	pq.push({s,0});
	bool vis[10005];
	memset(vis,0,sizeof vis);
	memset(dist,0x3f,sizeof dist);
	dist[s]=0;
	while(!pq.empty()){
		node t=pq.top();
		pq.pop();
		int u=t.to;
		if(vis[u])continue;
		vis[u]=1;
		for(auto it:g[u]){
			int v=it.to,w=it.w;
			if(dist[v]>dist[u]+w){
				dist[v]=dist[u]+w;
				pq.push({v,dist[v]});
			}
		}
	}
}
signed main(){
	cin>>n>>m>>s;
	for(int i=1,u,v,w;i<=m;i++){
		cin>>u>>v>>w;
		g[u].push_back({v,w});
	}
	dij();
	for(int i=1;i<=n;i++)cout<<dist[i]<<' '; 
	return 0;
}