为什么优先队列cmp wa 1 3 4 ？？？？qwq

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define N 100050
#define int long long
using namespace std;
int n,m,a,b;
int head[N],now=1;
int dis[N];
bool vis[N];
struct wfq{
    int nxt,to,v;
}bian[20000050];
void Add(int x,int y,int z)
{
    bian[now].to=y;
    bian[now].nxt=head[x];
    bian[now].v=z;
    head[x]=now;
    now++;
    return;
}
struct cmp{
    bool operator()(int a,int b){
        return dis[a]>dis[b];
    }
};
void dijkistra(int s)
{
    priority_queue<int,vector<int>,cmp>q;
    rep(i,1,n)dis[i]=2147483647;dis[s]=0;
    q.push(s);
    while(!q.empty())
    {
        int u=q.top();q.pop();
        vis[u]=1;
        for(int i=head[u];i;i=bian[i].nxt)
        {
            int z=bian[i].to;
            if(dis[z]>dis[u]+bian[i].v)
            dis[z]=dis[u]+bian[i].v;
            if(!vis[z])vis[z]=1,q.push(z);
        }
    }
}
signed main()
{
    cin>>n>>m>>a;
    rep(i,1,m)
    {
        int x,y,v;
        scanf("%lld%lld%lld",&x,&y,&v);
        Add(x,y,v),Add(y,x,v);
    }
    dijkistra(a);
    rep(i,1,n)printf("%lld ",dis[i]);
    return 0;
}