We consider polar codes constructed from the $2\times 2$ kernel $\begin{bmatrix} 1 & 0 \\ α& 1 \end{bmatrix}$ over a finite field $\mathbb{F}_{q}$, where $q=p^s$ is a power of a prime number $p$, and $α$ satisfies that $\mathbb{F}_{p}(α) = \mathbb{F}_{q}$. We prove that for any $\mathbb{F}_{q}$-symmetric memoryless channel, any code length, and any code dimension, all the codeword symbols in such polar codes have the same symbol error rate (SER) under the successive cancellation (SC) decoder.