Set
$$
s_n=a_1+\cdots+a_n, \quad n\in\mathbb N.
$$
Then $\{s_n\}$ converges, say to $s\in\mathbb R$. Next
$$
\sum_{k=1}^n\frac{a_k}{k}=\sum_{k=1}^n\frac{s_k-s_{k-1}}{k}=
\sum_{k=1}^n\frac{s_k}{k}-
\sum_{k=2}^n\frac{s_{k-1}}{k}=
\sum_{k=1}^n\frac{s_k}{k}-
\sum_{k=1}^{n-1}\frac{s_{k}}{k+1}\\=
\sum_{k=2}^ns_k\left(\frac{1}{k}-\frac{1}{k+1}\right)+\frac{s_n}{n}
=
\sum_{k=2}^n\frac{s_k}{k(k+1)}+\frac{s_n}{n}.
$$
Clearly, $\dfrac{s_n}{n}\to 0$, and
$$
\sum_{k=2}^n\frac{|s_k|}{k(k+1)}\le M\sum_{k=2}^n\frac{1}{k(k+1)}< \frac{M}{2},
$$
where $M$ is an upper bound of $\{|s_n|\}$, and hence
$$
\sum_{k=2}^n\frac{s_k}{k(k+1)}
$$
converges, due to the Comparison Test.