Send $5500 and I'll help!

Not even one can answer Benq Question! Benqosity

I don't have an easy solution, but the following paper provide (somewhat sophisticated) $$$O(V^2)$$$ solutions:

• EDGE-DISJOINT SPANNING TREES, DOMINATORS, AND DEPTH-FIRST SEARCH by Robert E. Tarjan solves the problem in $$$O(V \log V + E)$$$ using dfs (the algorithm also computes the dominator tree).
• A Matroid Approach to Finding Edge Connectivity and Packing Arborescences by Harold N. Gabow solves the problem of finding $$$k$$$ edge-disjoint Arborescences in $$$O(k^2 V^2)$$$. The algorithm is based on Matroid intersection theory and augmenting paths (and I don't know much about those topics).