This is kind of a fundamental consequence of the definition of the Lebesgue integral, and so one cannot avoid this definition, and hence one cannot avoid measure theory in actually showing this.
Here's the standard development:
A nonnegative simple random variable is (roughly) one that only takes a finite number of nonnegative values, each of which is finite. More precisely, these are maps of the form $$U(\omega) = \sum_{i = 1}^n a_i \mathbf{1}_{E_i}(\omega),$$ where the $E_i$ are disjoint events, $a_i \in [0, \infty),$ and $n < \infty$. The idea is that its easy to define the integral of simple RVs by basically thinking about linearity: $\mathbb{E}[U] = \sum a_i P(E_i).$
For a non-negative random variable $X$, the expectation is defined as $$\mathbb{E}[X] := \sup\{\mathbb{E}[U] : U \le X, U \textrm{ simple, nonnegative}\}.$$ While the above is certainly well defined, it is not obvious that this matches your usual sense of the expectation: e.g., if the RVs have a nice density (what does that even mean, in the measure theoretic sense?), then does this definition yield $\mathbb{E}[X] = \int x f_X(x) \mathrm{d}x$? I'll leave it to you to consult an appropriate textbook for actually understanding this definition.
Proposition: If a random variable $X \ge 0$ satisfies $P(X = 0) = 1,$ then $\mathbb{E}[X] = 0$.
Pf. Let $E = \{\omega: X(\omega) \neq 0\}$. For any simple function $ U = \sum_{i \le n} a_i \mathbf{1}_{E_i},$ if $U \le X,$ then for any $i : a_i > 0, E_i \subset E,$ and so $P(E_i) = 0.$ It thus follows that $\mathbb{E}[U] = \sum_{i } a_i P(E_i) = \sum_{i : a_i \le 0} a_i P(E_i) = 0$. But then $\mathbb{E}[X]$ is a supremum of the singleton set $\{0\},$ and so equals $0$.
There are now two complications in the case of your question:
For general random variables, the definition of integrals needs to consider the positive and negative parts separately. However, when dealing with $P(X = 0) = 1,$ we can simply deal with the nonnegative random variable $|X|$ instead, since $x = 0 \iff |x| = 0$, and since $|\mathbb{E}[X]| \le \mathbb{E}[|X|]$. So, in the following, lets set $Y_n(\omega) = |X_n(\omega)|$. Of course, by continuity, $X_n(\omega) \to x \implies Y_n(\omega) \to |x|$.
A final complication in the situation of the question is that we don't know that $\lim Y_n(\omega)$ is a random variable, since this may not exist for some $\omega$. Here the almost sure convergence lets us avoid this issue: pick any random variable $Z,$ and let us define $$ Y(\omega) = \begin{cases} \lim Y_n(\omega) & \lim Y_n(\omega) \textrm{ exists } \\ Z(\omega) & \lim Y_n(\omega) \textrm{ doesn't exist}\end{cases}.$$ Since $P(\lim Y_n = 0) =1,$ no matter what $Z$ we pick, we also have $P(Y = 0) = 1.$ The technical term is that each such $Y$ is a version of $\lim Y_n$.
But now, for any version, since $Y \ge 0, P(Y = 0) = 1,$ the conclusion that $\mathbb{E}[Y] = 0$ follows from the proposition above. This controls $\mathbb{E}[\lim X_n]$ (or again, any version of this) to have mean $0$ using $0 \le |\mathbb{E}[\lim X_n]|\le \mathbb{E}[Y] = 0.$