#include <iostream>
#include <queue>
#include <vector>
using namespace std;

const int maxn = 100005;
const int INF = 2e9;
vector<pair<int, int>> graph[maxn];
int n;

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 main()
{
    
    cin >> n;
    int m;
    cin >> 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));
    }
    int S, E;
    cin >> S >> E;
    
    vector<bool> visited(n, false);
    vector<int> dist(n, INF);
    
    dist[S] = 0;
    
    priority_queue<node> pq;
    pq.push(node(S, 0));
    
    while(!pq.empty()) {
        node current_node = pq.top();
        pq.pop();
        
        if(visited[current_node.idx]) {
            continue;
        }
        visited[current_node.idx] = true;
        
        for(int i = 0; i < (int) graph[current_node.idx].size(); i++) {
            int neighbour = graph[current_node.idx][i].first;
            int weight = graph[current_node.idx][i].second;
            
            if(!visited[neighbour] and current_node.shortest_path + weight < dist[neighbour]) {
                dist[neighbour] = current_node.shortest_path + weight;
                pq.push(node(neighbour, dist[neighbour]));
            }
            
        }
    }
    
    cout << dist[E] << endl;
    
    
    
    
    return 0;
}