Graph Coloring · Easy problem

A dispatcher hub $0$ is directly linked to four field stations $1, 2, 3, 4$, which have no links to each other. With $3$ colors available, two linked stations (or the hub and a station) must always get different colors. In how many ways can all five sites be colored?