How to construct a directed graph to compute its max flow if its undirected AND with vertex capacities

Suppose we are given this graph:

enter image description here

If I want to calculate its max flow. My guess would be that I need to first convert the weighted vertices into unweighted vertices by doing something like this:

enter image description here

And since this is not a directed graph, I assume we that I need to create 2 symmetric edges per “regular” edge. However, this is where I get stuck because I am not sure where exactly those edges are suppose to connect with the “in” and “out” vertices I created earlier.

Help would be very appreciated. Thank you.