Find all paths with min weights in an undirected graph

You are given a list of edges in a graph with weight. Find all the paths between start node and end node with min weights in the path. The edges like