Can MONOTONE WSAT be in solved in polynomial time?
This problem is indeed NP-complete.

Actually, the answer for this question is answered in: 

https://cs.stackexchange.com/questions/11558/prove-np-completeness-of-deciding-satisfiability-of-monotone-boolean-formula

Therefore, this question is closed and answered...