There are many cases in which we put weights on the edges of a graph or digraph and ask for the minimum or maximum weight object. The optimization questions that arise from this are the backbone of Combinatorial optimization. When the weights are random variables, we can ask for properties of the optimum value, which will be also a random variable. In this chapter, we consider three of the most basic optimization problems: minimum weight spanning trees, shortest paths, and minimum weight matchings.