Your language consists of all words over $\{a,b\}$ which contain $a$. This is a regular language, and so it has aan unambiguous regular grammar, - essentially a DFA - which is not so difficult to construct for this language. Regular grammars constructed from DFAs are unambiguous, so this would be an unambiguous grammar for the same language.
