Adding edges one by one

You have an undirected graph with n vertices and no edges, plus a list of m weighted edges. You add the edges of the list to the graph one at a time, in any order you like, and you stop the moment vertices s and t become connected. Two vertices are connected when you can walk from one to the other along edges.

Choose the order so that the total weight of the edges in the graph at the moment you stop is as large as possible. That total includes the weight of the last edge, the one that connected s and t. Print the largest total you can reach.

The first line has the number of vertices n and the number of edges in the list m. ($2 \le n \le 50$, $1 \le m \le 1000$)

Each of the next m lines has three integers a, b, c, meaning the list holds an edge of weight c between vertex a and vertex b. ($1 \le a, b \le n$, $1 \le c \le 100$, $a \ne b$)

The last line has the two vertices s and t. ($1 \le s, t \le n$, $s \ne t$)

The list may hold several edges between the same pair of vertices. Adding every edge of the list makes the graph connected.

Print on the first line the largest possible total weight of the edges added up to the moment s and t become connected.