Given a directed weighted graph G = (V, E) with every edge e has weight w(e) > 1. Assume G contains a node s that can reach all other nodes. Prove that there exists a directed tree T in G with root s as a subgraph in G, with the property that the path from s to any other node v in T is the shortest path from s to v in G.