Graph Coloring · Medium problem

Two SEPARATE triangles, $\{0,1,2\}$ and $\{3,4,5\}$, share no links with each other at all ($6$ edges total, $3$ in each triangle). With $4$ colors available, in how many ways can all $6$ devices be properly colored?