Cities $A,B,$ and $D$ are connected by roads as shown in the image. There are two roads connecting $A$ and $B$, one road connecting $A$ and $D$, and one road connecting $B$ and $D$. How many different routes are there from $A$ to $B$ that use each road exactly once?