Given a directed weighted graph G = (V, E) such that every edge is bi-directional (i.e. an edge (u, v) in G implies another edge (v, u) and they have same weights. Fix an arbitrary node v in G (i.e. a directed tree T in G with root v as a subgraph in G), and prove that T is the minimum spanning tree of G if ignoring the directions on G.