Lattice Paths in a Grid with Constraint

By only moving either up or right at a time, how many ways are there to get from point $A$ to $D$, without passing through $B$ and $C$?