Algorithm for seeing if there exists a min s-t cut (A,B) in a flow network with node u in A and node v in B
The easy solution is to add an edge between $s$ and $u$ with infinite weight and $t$ and $v$ with infinite weight.
Note though that this doesn't mean that $s$ and $u$ will be connected in $G[A]$.