#include <queue>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 10;
const int INF = 2e9;
struct node {
    int idx, cost;
    node(){}
    node(int _idx, int _cost) {
        idx = _idx;
        cost = _cost;
    }
    bool operator < (const node & tmp) const {
        return cost > tmp.cost;
    }
};
vector<pair<int, int> > graph[maxn];
void dijkstra(int S, int E) {
    vector<bool> visited(maxn, false);
    vector<int> distance(maxn, INF);

    distance[S] = 0;
    priority_queue<node> pq;
    pq.push(node(S, 0));

    while(!pq.empty()) {
        node c = pq.top();
        pq.pop();

        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.cost + weight < distance[neighbour]) {
                pq.push(node(neighbour, c.cost + weight));
                distance[neighbour] = c.cost + weight;
            }
        }
    }
    cout << distance[E] << endl;

}
int main(int argc, const char * argv[]) {

    return 0;
}