The capacity of a cut is the sum of capacities of all edges going from to . Edges from to do not count in a directed graph. Direction matters. For an undirected graph, you count each crossing edge once, regardless of direction.
For a directed graph, only edges leaving and entering contribute to the capacity. The capacity measures how much flow you need to block to disconnect from . If you saturate all edges crossing the cut, no more flow can pass through.