IChinese postman problem is one of the classical combinatorial optimization problems with many applications. However, in application, some uncertain factors are frequently encountered. This paper employs uncertain programming to deal with Chinese postman problem with uncertain weight Within the framework of uncertainty theory, the concepts of expected shortest route, ${alpha}$-shortest route, and distribution shortest route are proposed. After that, expected shortest model, and ${alpha}$-shortest model are constructed. Taking advantage of properties of uncertainty theory, these models can be transf-ormed into their corresponding deterministic forms, which can be solved by classical algorithm..