uLoHQB - Online C++0x Compiler & Debugging Tool

/* AUTHOR: TUAN ANH - BUI */
// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) return x = y, true;
        return false;
    }

template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) return x = y, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */

const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 27092008;
const ll INF  = (ll)1e18 + 27092008;
const int N = 2e5 + 5;
int n, m, k, s, t;
vector<ii> G[N], rG[N];
ll dist[N];

void dijkstra() {
    priority_queue<ii, vector<ii>, greater<ii> >  Q;
    Q.push(mp(0, s));
    FOR(i, 1, n) dist[i] = INF;
    dist[s] = 0;
    while(!Q.empty()) {
        ll du = Q.top().fi;
        int u = Q.top().se;
        Q.pop();
        if (du != dist[u]) continue;
        for(ii v : G[u]) {
            if (dist[v.fi] > dist[u] + v.se) {
                dist[v.fi] = dist[u] + v.se;
                Q.push(mp(dist[v.fi], v.fi));
            }
        }
    }
}

void init(void) {
    cin >> n >> m >> k >> s >> t;
    FOR(i, 1, m) {
        int u, v, w;
        cin >> u >> v >> w;
        G[u].pb(mp(v, w));
        rG[v].pb(mp(u, w));
    }
}

void process(void) {
    ll ans = INF;
    dijkstra();
    ans = dist[t];
    while(k--) {
        int u, v, w;
        cin >> u >> v >> w;
        G[u].pb(mp(v, w));
        G[v].pb(mp(u, w));
        dijkstra();
        ans = min(ans, dist[t]);
        G[u].pop_back();
        G[v].pop_back();
    }
    cout << (ans == INF ? -1 : ans);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
        freopen("gen.inp", "r", stdin);
        freopen("gen.ans", "w", stdout);

    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}