Find the minimum weighted path in a graph with additional conditions

Question

I have a problem as below and I am really stuck with it as it run with more than the time I desired (about 1 second)

Given an undirected graph G = (V, E)