题意翻译为：

给出一个有$n$个结点，$m$条带权边的无向连通图，边权为经过这条边所需的时间。有$k$个点设有传送门，初始时，传送门都关闭。你从$1$号点出发，每当你到达一个已开启传送门的点，那个传送门就会永久开启，你可以从一个开启的传送门花费$0$时间到达另一个开启的传送门。求开启所有传送门所需的最小时间

此题意翻译中未提到如何开启传送门，与英文题面中相关部分对照：

Pavel plays a famous computer game. A player is responsible for a whole country and he can travel there freely, complete quests and earn experience.

This country has $n$ cities connected by $m$ bidirectional roads of different lengths so that it is possible to get from any city to any other one. There are portals in $k$ of these cities. At the beginning of the game all portals are closed. When a player visits a portal city, the portal opens. Strange as it is, one can teleport from an open portal to an open one. The teleportation takes no time and that enables the player to travel quickly between rather remote regions of the country.

At the beginning of the game Pavel is in city number $1$ . He wants to open all portals as quickly as possible. How much time will he need for that?

可以得到，加粗部分应翻译为

每当你到达一个有传送门的点，那个传送门就会永久开启