Although this question has been posted here many times, I am posting it again in order to get my proof verified.
Firstly, we break up the index set of $(u_n)_n$ into a partition of two sets $A$ and $B$ such that:
$A= \{n\in \mathbb{N}:u_n<1\}$ and $B=\{n\in \mathbb{N}: u_n \ge 1 \}$.
Now, $u_n<1 \implies u_n +1<2 \implies \displaystyle\frac{u_n}{2}<\frac{u_n}{1+u_n} $. Taking summation over $A \ \ $,
$\frac{1}{2}\displaystyle\sum_{n \in A}u_n < \sum_{n \in A} \frac{u_n}{1+u_n} ...(1)$
Again, $u_n \geq 1 \implies 2u_n\geq1+ u_n \implies \displaystyle\frac{u_n}{1+u_n} \ge \frac{1}{2} $
The sum over $B$ becomes $\frac{1}{2}\displaystyle |B| \le \sum_{n \in B} \frac{u_n}{1+u_n} ...(2)$ [$|B|$ denotes the number of elements in $B$].
Since $A$ and $B$ form a partition of $\mathbb{N}$, then either of them (or both) must be an infinite set.
Three cases may arise:
\begin{cases} A \mathbb{\ is \ infinite \ but} B \mathbb{ \ is \ finite} \\ B \mathbb{\ is \ infinite \ but} A \mathbb{ \ is \ finite} \\ \mathbb {both \ are \ infinite} \end{cases}
In the first, second and third cases, the left hand sides of $1$, $2$, & $1 { \ \mathbb{and} \ } 2$ diverges respectively. In any case, $\sum \frac{u_n}{1+u_n}$ diverges.
Please verify this method. It will be of immense help for me.
I'm transferring @mathworker21's solution into an answer, so I'll make this CW.
If $\sum \dfrac{u_n}{1+u_n} < \infty$, then $\dfrac{u_n}{1+u_n} \to 0$, so $u_n \to 0$, so $\dfrac{u_n}{1+u_n} \ge \frac12 u_n$ for $n$ sufficienty large, so $\sum \dfrac{u_n}{1+u_n}$ diverges by comparison test.