A $Γ$-labeled graph is an oriented graph with edges invertibly labeled by a group $Γ$. We prove a structure theorem for $Γ$-labeled graphs which forbid a fixed $Γ$-labeled graph as an immersion, for any finite $Γ$. Roughly, we show that such graphs admit a tree-cut decomposition in which every bag either contains few high degree vertices or is nearly signed over a proper subgroup of $Γ$.