#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#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<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} 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<tuple<int, int, int>> d(n);
  rep(i, n) {
    int a, b, c;
    cin >> a >> b >> c;
    d[i] = {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;
    auto [a0, b0, c0] = d[0];
    if (a0 + b0 + c0 >= a + b + c) {
      l = mid;
      continue;
    }
    int sm_tmp = a + b + max({c, a0, b0, c0});
    bool ok = false;
    for(int v: to[0]) {
      auto [av, bv, cv] = d[v];
      if (sm_tmp > av + bv + cv) {
        ok = true;
        break;
      }
    }
    if (!ok) {
      l = mid;
      continue;
    }
    priority_queue<P, vector<P>, greater<P>> q;
    vector<char> added(n);
    auto push = [&](int v) {
      if (added[v]) return;
      added[v] = true;
      auto [a, b, c] = d[v];
      q.emplace(a + b + c, v);
    };
    push(0);
    while(q.size()) {
      auto [sm, u] = q.top(); q.pop();
      if (sm >= a + b + c) {
        ok = false;
        break;
      }
      if (u == n - 1) break;
      auto [au, bu, cu] = d[u];
      for(int x: {au, bu, cu}) {
        if (x > c) {
          c = x;
          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';
}