The valuationlly decided formula question(briefly,VDF question) has been proposed and solved in classical 2-valued propositional logic and ukasiewicz 3-valued propositional logic and p+1-valued propositional logic.This paper provides the solution to the VDF problem in more general versions of ukasiewicz propositional logic systems.The reasonable condition of VDF is studied first.Secondly,constructive solutions of the VDF questions in L_n and L_a are given.Lastly,the VDF problem in L_c of ukasiewicz system is solved.