Graph Coloring · Easy problem

A relay tower $T$ communicates with towers $1$ and $2$ (which also communicate with each other), and separately with towers $3$ and $4$ (which also communicate with each other). With $3$ frequencies available, in how many different ways can all five towers be assigned frequencies so that no two communicating towers share one?