Does this BFS-based algorithm work for find shortest path in weighted graph

Question

I know that plain BFS search can be used for find shortest path in unweighted graph or graph with same edge weight, and Dijkstra should be used in weighted graph, and Dijkst