#include 
#include 
#include 
using namespace std;
const int maxn = 100005;
const int INF = 2e9;
int n, m;
vector> graph[maxn];
struct node {
    int idx, shortest_path;
    node () {}
    node(int _idx, int _shortest_path) {
        idx = _idx;
        shortest_path = _shortest_path;
    }
    bool operator < (const node & tmp) const {
        return shortest_path > tmp.shortest_path;
    }
};
int dijkstra(int S, int E) {
    vector visited(n, false);
    vector dist(n, INF);
    
    dist[S] = 0;
    priority_queue pq;
    pq.push(node(S, 0));
    
    while(!pq.empty()) {
        node c = pq.top();
        pq.pop();
        
        if(c.idx == E) {
            return c.shortest_path;
        }
        if(visited[c.idx]) {
            continue;
        }
        visited[c.idx] = true;
        
        for(int i = 0; i < (int) graph[c.idx].size(); i++) {
            int neighbour = graph[c.idx][i].first;
            int weight = graph[c.idx][i].second;
            
            if(!visited[neighbour] and c.shortest_path + weight < dist[neighbour]) {
                dist[neighbour] = c.shortest_path + weight;
                pq.push(node(neighbour, dist[neighbour]));
            }
            
        }
    }
    return -1;
}
int main() {
    cin >> n >> m;
    
    for(int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        graph[a].push_back(make_pair(b, c));
        graph[b].push_back(make_pair(a, c));
    }
    
    cout << dijkstra(0, 5) << endl;
    cout << dijkstra(3, 1) << endl;
    cout << dijkstra(1, 4) << endl;

    
    return 0;
}