Its False, suppose language is finite for example L = { $\epsilon$ , a , aa, aab, aabb } over alphabet {a,b}
Its NFA will look something like this.
Even though all states are final state in NFA, there are many string which is present in ∑* , but NFA is not capable of accepting it.