Hello there

I'm trying to solve this problem where i have to find the minimum shortest path spanning tree from vertex u

I'm trying to solve it with dijkstra where i take the shorter edge when two paths are equal to the same node ... and i found that what i've been doing is the intended solution from the editorial

but i keep getting WA on test 8 and it says duplicate edges ... but i can't see where my code could do that

here is my submission

please help :/