Graph Coloring · Medium problem

A triangle $0,1,2$ has TWO extra pendant devices, $3$ and $4$, both linked only to device $0$ ($5$ links in all). With $3$ colors available, in how many ways can all $5$ devices be properly colored?