Partition edges into edge disjoint walks
Create a new source and connect it to $s_1,\ldots,s_k$, and create a new sink and connect it to $t_1,\ldots,t_k$.
Every edge has capacity $1$ and cost $−1$.
With this, the problem is a special case of the min-cost flow problem.