We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $Γ$, a $Γ$-labelled graph is a graph whose edges are labelled by elements of $Γ$. For an abelian group $Γ$ and $A\subseteq Γ$, the $(Γ, A)$-vertex-arboricity of a $Γ$-labelled graph is the minimum integer $k$ such that its vertex set can be partitioned into $k$ parts where each part induces a subgraph having no cycle of value in $A$. We prove that for every positive integer $ω$, there is a function $f_ω:\mathbb{N}\times\mathbb{N}\to \mathbb{R}$ such that if $|Γ\setminus A|\le ω$, then every $Γ$-labelled graph with $(Γ, A)$-vertex-arboricity at least $f_ω(t,d)$ contains a subdivision of $K_t$ where all branching paths are of value in $A$ and of length at least $d$. This extends a well-known result that every graph of sufficiently large chromatic number contains a subdivision of $K_t$, in various directions.