样例能过，但是第一个点就不行了，哪位大佬帮帮孩子的忙吧

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 3e5 + 5;

int h[N];
int ne[N];
int e[N];
int idx;
int w[N];
bool st[N];
long long ans;
int n, m;
int dist[N];

void add(int u,int v,int c)
{
    e[idx] = v;
    w[idx] = c;
    ne[idx] = h[u];
    h[u] = idx ++ ;
}

priority_queue<pair<int, int>,vector<pair<int, int>>,greater<pair<int, int>>> q;

void dijkstra(int qs)
{
   
    memset(st, 0, sizeof(st));
    
    // memset(st, -1, sizeof(st));
    dist[qs] = 0;

    q.push({dist[qs],qs});

    while(!q.empty())
    {
        auto k = q.top();

        int distance = k.first;
        int ver = k.second;

        if(st[ver]) continue;
        st[ver] = 1;
        // if(dist[ver] < dist)

        q.pop();

        for(int i = h[ver]; ~i; i = ne[i])
        {
            int j = e[i];

            // if(!st[j])
            if(dist[j] > w[i] + distance)
            {
                dist[j] = w[i] + distance;
                q.push({dist[j],j});
            }
        }
    }

}

signed main()
{
	cin.tie(nullptr)->sync_with_stdio(false);
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);    
    
    cin >> n >> m;

    memset(h, -1, sizeof(h));

    for(int i = 1; i <= n << 1; ++ i)   dist[i] = 0x3f;

    for(int i = 1; i <= m; ++ i)
    {
        int x, y, c;
        cin >> x >> y >> c;
        add(x, y, c);
        add(y + n, x + n, c);
    }

    dijkstra(1);

    for(int i = 2; i <= n; ++ i)    ans += dist[i];

    // cout << ans << ' ';

    dijkstra(n + 1);

    for(int i = n + 2; i <= n << 1; ++ i)    ans += dist[i];

    cout << ans << '\n';
}