wa了第五个测试点 不知道为什么 求助大神

#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include <iomanip>
#include <ctime>

#define INF 0x3f3f3f3f
#define x first
#define y second
#define lowbit(x) ((x) & (-x))
#define pi 4*atan(1.0)
#define N 2000005
#define endl '\n'
#define int long long

using namespace std;
//int pri[]={ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
typedef pair<int, int> PII;
int st[N];
int dis[N];
int T,C,TS;
int h[N],e[N],ne[N],w[N],idx;
void add(int a,int b, int c)
{
	e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++; 
}
void dj()
{
	memset(dis,0x7f,sizeof dis);
	dis[TS]=0;
	
	priority_queue<PII,vector<PII>,greater<PII>> q;
	q.push({0,TS});
	while(q.size())
	{
		PII t=q.top();
		q.pop();
		
		int ver=t.y;
		int distance=t.x;
		
		if(st[ver])continue;
		st[ver]=1;
		
		for(int i=h[ver];i!=-1;i=ne[i])
		{
			int j=e[i];
			if(st[j]dis[j]>dis[ver]+w[i])
			{
				dis[j]=dis[ver]+w[i];
				q.push({dis[j],j});//距离和点 
			}
		}
	}
	
}

void solve()
{
	cin>>T>>C>>TS;

	memset(h,-1,sizeof h);

	while(C--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		add(a,b,c);
	}

	dj();
	
	for(int i=1;i<=T;i++)
	{
		if(dis[i]>INF/2)cout<<"2147483647"<<" ";
		else cout<<dis[i]<<" ";
	} 

} 
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	solve();

}