#include namespace { #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic pop using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; VVI to(n); rep(_, m) { int u, v; cin >> u >> v; u--, v--; to[u].emplace_back(v); to[v].emplace_back(u); } vector

d(n); rep(i, n) { int a, b, c; cin >> a >> b >> c; d[i] = {a + b + c, max({a, b, c})}; } int l = 0; int r = 4e8; while(r - l > 1) { int mid = (l + r) / 2; int a = mid, b = 1, c = 1; priority_queue, greater

> q; vector added(n); auto push = [&](int v) { if (added[v]) return; added[v] = true; q.emplace(d[v].first, v); }; push(0); bool ok = true; while(q.size()) { auto [sm, u] = q.top(); q.pop(); if (sm >= a + b + c) { ok = false; break; } if (u == n - 1) break; if (d[u].second > c) { c = d[u].second; if (b < c) { swap(b, c); if (a < b) swap(a, b); } } for(int v: to[u]) push(v); } if (ok) r = mid; else l = mid; } cout << 1 << ' ' << 1 << ' ' << r << '\n'; }