#Japt, 15 bytes
My first (somewhat) serious Japt submission! Any help is appreciated, I think ~10 bytes or even less may be possible.
£Ueu *Ug >1 *Xz How it works
£Ueu *Ug >1 *Xz – Full program. £ – For each X of the input array. *Xz – Multiply floor(X/2) by the truth value of: Ueu – Are both numbers odd? And... *Ug >1 – Is the initial element greater than 1? – Implicit output to STDOUT.