Yes, $X_{n} \to 0$ almost surely. The argument I have is a little convoluted, so bear with me.
First, consider the events $F_{k} = \bigcup_{n \geq k} \{ C_{n} > 2 \}$. By the almost sure convergence of the $C_{n}$ it follows that $P( \bigcap_{k} F_{k} ) = 0$, and since $F_{1} \supseteq F_{2} \supseteq \cdots$ we have $P(F_{k}) \to 0$. So it suffices to show that $X_{n} \to 0$ a.s. within $F_{k}^{c}$, for any $k$.
Now fix a $k$ and an $\varepsilon > 0$. Using the notation $E[X; A]$ to represent $E[X 1_{A}]$, we have for $n \geq k$
\begin{equation}
E[X_{n} ; F_{k}^{c}]
\leq E[X_{n} ; C_{n} \leq 2]
= E[ E(X_{n} | C_{n}) ; C_{n} \leq 2]
= E[ C_{n} / n^{2} ; C_{n} \leq 2 ]
\leq 2 / n^{2}.
\end{equation}
This is kind of the key part. (Note, too, that we used the nonnegativity of $X_{n}$ in the first step, to pass from $F_{k}^{c}$ to the larger event $C_{n} \leq 2$.) From here we just need some fairly run-of-the-mill measure theoretic arguments.
The bound above, together with the nonnegativity of $X_{n}$, implies that
$P(F_{k}^{c} \cap \{ X_{n} > \varepsilon \}) \leq \frac{2}{n^{2} \varepsilon}$ (for $n \geq k$), so that
\begin{equation}
\sum_{n \geq k} P(F_{k}^{c} \cap \{ X_{n} > \varepsilon \})
< \infty.
\end{equation}
By the Borel-Cantelli Lemma we can now say that the event
\begin{equation}
F_{k}^{c} \cap \{ X_{n} > \varepsilon \, \text{for infinitely many $n$} \}
\end{equation}
has probability zero. Since $\varepsilon$ was arbitary, this gets us $X_{n} \to 0$ a.s. on $F_{k}^{c}$.