If a deterministic finite automaton recognizes a language, must that language contain every accepting input?
No.
The language (only one!) recognized by a DFA is the set of all inputs it accepts.
The definition of a DFA also includes its alphabet, so you have to consider that an intrinsic part of the DFA. If you change the alphabet at all, you now have a new and different DFA, which potentially recognizes a different language.