Countability Problem 2

Solution

This is countable. For any n, there are only finitely many ways to color the nodes of \(W_n\). So the whole set is the union of countably many finite sets, which is countable.