The cordiality game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting \track{unlabeled} vertices of $G$. Admirable labels the selected vertices by $0$ and Impish by $1$, and the resulting label on any edge is the sum modulo $2$ of the labels of the vertices incident to that edge. The two players have opposite goals: Admirable attempts to minimize the number of edges with different labels as much as possible while Impish attempts to maximize this number. When both Admirable and Impish play their optimal games, we define the \emph{game cordiality number}, $c_g(G)$, as the absolute difference between the number of edges labeled zero and one. Let $P_n$ be the path on $n$ vertices. We show $c_g(P_n)\le \frac{n-3}{3}$ when $n \equiv 0 \pmod 3$, $c_g(P_n)\le \frac{n-1}{3}$ when $n \equiv 1 \pmod 3$, and $c_g(P_n)\le \frac{n+1}{3}$ when $n \equiv 2\pmod 3$. Furthermore, we show a similar bound, $c_g(T) \leq \frac{|T|}{2}$ holds for any tree $T$.