// template version 1.12 using namespace std; #include #include // varibable settings #define infile "../test/sample-1.in" #define int long long //{{{ const int INF=1e18; const int MOD=1e9+7; //}}} // define basic macro {{{ #define _overload3(_1,_2,_3,name,...) name #define _rep(i,n) repi(i,0,n) #define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i) #define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__) #define _rrep(i,n) rrepi(i,0,n) #define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i) #define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__) #define each(i,a) for (auto&& i : a) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define pb(a) push_back(a) #define mp(a, b) make_pair(a, b) #define uni(x) sort(all(x));x.erase(unique(all(x)),x.end()) #define ub upper_bound #define lb lower_bound #define posl(A, x) (lower_bound(all(A), x)-A.begin()) #define posu(A, x) (upper_bound(all(A),x)-A.begin()) template inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); } template inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); } typedef long long ll; typedef vector vi; typedef vector vvi; typedef long double ld; typedef pair pii; typedef tuple iii; template using PQ = priority_queue, greater>; struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast; #if defined(PCM) || defined(LOCAL) #include "lib/dump.hpp" #else #define dump(...) 42 #define dump_1d(...) 42 #define dump_2d(...) 42 #endif //}}} using COST = int; using POS = int; using EDGE = pair; struct GRAPH{ map> all_edges; void add_edge(POS from, POS to, COST cost){ all_edges[from].emplace_back(mp(to, cost)); } auto operator[](POS pos){ return all_edges[pos]; } }; map dijkstra(GRAPH& G, POS start){ map d; // 最短距離 // TODO: vectorの場合はd[*]=INFにしておく。 PQ> q; q.push(mp(0LL, start)); while (!q.empty()){ auto cp = q.top(); q.pop(); auto cost = cp.first; auto pos = cp.second; if (d.find(pos)==d.end() || cost < d[pos]) { d[pos] = cost; for (const auto &el:G[pos]){ auto ncost = cost + el.second; auto npos = el.first; q.push(mp(ncost, npos)); } } } return d; } int solve(){ int n,m,p,q,t; cin>>n>>m>>p>>q>>t; p--;q--; GRAPH G; rep(i, n){ POS from, to; COST cost; cin>>from>>to>>cost; from--;to--; G.add_edge(from, to, cost); G.add_edge(to, from, cost); } dump(G); // calc min distance by G auto d0 = dijkstra(G, 0); auto dp = dijkstra(G, p); auto dq = dijkstra(G, q); dump(d0); dump(dp); dump(dq); dump(d0[p], d0[q]); if (2*d0[p]>t or 2*d0[q]>t){ cout << -1 << endl; return 0; } if(d0[p] + d0[q] + dp[q] <= t){ cout << t << endl; return 0; } int ans = 0; rep(ic, n){ rep(jc, n){ int res = 0; res += d0[ic]+d0[jc]; int wait = t-(res+max(dq[ic]+dq[jc], dp[ic]+dp[jc])); if (wait>=0){ chmax(ans, res+wait); } } } cout << ans << endl; return 0; } signed main() { //{{{ #ifdef INPUT_FROM_FILE std::ifstream in(infile); std::cin.rdbuf(in.rdbuf()); #endif solve(); return 0; } //}}}