Union-free regular languages and 1-cycle-free-path-automata