Let D = (V; A) be a digraph, and k be a positive integer. Suppose that for three distinct nodes u, v and w, there are k edge-disjoint paths from u to v and k edge-disjoint paths from v to w. Show that there are also k edge-disjoint paths from u to w.