Eulerian and Hamiltonian Graphs · Easy problem

Two squares share a corner: $A\text{-}B\text{-}C\text{-}D\text{-}A$ and $D\text{-}E\text{-}F\text{-}G\text{-}D$, joined only at $D$ (edges $AB,BC,CD,DA,DE,EF,FG,GD$). This graph has an Euler circuit. Not counting its very start and end, how many times does the circuit pass through $D$?