Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge variants with special emphasis on locally finite connected graphs. We show that every locally finite connected graph has a distinguishing colouring with at most countable number of colours or every locally finite connected graph has a proper colouring with at most countable number of colours if and only if Kőnig's Lemma holds. This statement holds for both vertex and edge colourings. Furthermore, we show that it is not provable in ZF that such colourings exist even for every connected graph with maximum degree 3. We also formulate a few conditions about distinguishing and proper colourings which are equivalent to the Axiom of Choice.