迪杰斯特拉 求助，样例错了

#include<bits/stdc++.h>
#define ll long long
#define ri register int
#define maxn 10005
#define maxm 500005
#define INF  1234567890
using namespace std;
struct Edge {
int from,to,w,next;
}e[maxm];
int head[maxn],cnt,n,m,s,vis[maxn],dis[maxn];
struct node {
int w,now;
};
inline bool operator < (node x, node y)
{return x.w>y.w;}
priority_queue<node>q;
inline void add(int from,int to,int w) {
e[++cnt].from=from;
e[cnt].to=to;
e[cnt].w=w;
e[cnt].next=head[from];
head[from]=cnt;
}
inline void dijkstra() {
for(ri i=1;i<=n;++i) {dis[i]=INF;}
dis[s]=0;
q.push((node){0,s});
while(!q.empty()) {
    node x=q.top();
    q.pop();
    int u = x.now;
    if(vis[u]) continue;
    vis[u]=1;
    for(ri i = head[u]; i; i = e[i].next) {
        int v=e[i].from;
        if(dis[v]>dis[u]+e[i].w) {
            dis[v]=dis[u]+e[i].w;
            q.push((node){dis[v],v});
        }
    }
}
}
int main() {
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
ios :: sync_with_stdio(false);
cin >> n >> m >> s;
for(ri i = 1, x, y, z; i <= m; ++i) {
    cin >> x >> y >> z;
    add(x,y,z);
}
dijkstra();
for(ri i = 1; i <= n; ++ i)
    cout << dis[i] << " ";
return 0;
}