Simplification of time complexity notation

Question

I want to simplify a big O time complexity notation for my algorithm. The algorithm calculates relative distances between a subset of sampled nodes V_s and all other nodes V in graph G through a single-source shortest path algorithm with time complexity O(V+E). This would result in an overall complexity of O(V(V_s(V+E))) with practical implementation:

for node in V:
    for sampled node in Vs:
        single-source shortest path calculation(node, sampled node)

Can I simplify this to a complexity of O(V_s(V²+VE)) which would then be approximately O(V³) ?