We study non-Boolean PCPs that have perfect completeness and read three positions from the proof. For the case when the proof consists of values from a domain of size d for some integer constant d >= 2, we construct a non-adaptive PCP with perfect completeness and soundness d^{-1} + d^{-2} ... more >>>