/* -*- coding: utf-8 -*-
 *
 * 1898.cc:  No.1898 Battle and Exchange - yukicoder
 */

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_S = 300000000;

/* typedef */

typedef vector<int> vi;
typedef pair<int,int> pii;

struct Card {
  int a, b, c;
  Card() {}
  Card(int _a, int _b, int _c): a(_a), b(_b), c(_c) {}
  Card(int s): a(1), b(1), c(s - 2) {}

  void sort() {
    if (a > b) swap(a, b);
    if (b > c) swap(b, c);
    if (a > b) swap(a, b);
  }
  
  void read() { scanf("%d%d%d", &a, &b, &c); sort(); }

  void takeone(Card &cd) {
    if (a < cd.c) {
      swap(a, cd.c);
      sort(), cd.sort();
    }
  }

  void takeall(Card &cd) {
    while (a < cd.c) takeone(cd);
  }

  int sum() const { return a + b + c; }
  bool operator<(const Card &cd) const { return sum() < cd.sum(); }
  bool operator>(const Card &cd) const { return sum() > cd.sum(); }
  bool operator<=(const Card &cd) const { return sum() <= cd.sum(); }
  bool operator>=(const Card &cd) const { return sum() >= cd.sum(); }
};

/* global variables */

vi nbrs[MAX_N];
Card cds[MAX_N], vcds[MAX_N];
bool ds[MAX_N];

/* subroutines */

bool check(int n, int s) {
  Card ucd(s);
  if (cds[0] >= ucd) return false;

  copy(cds, cds + n, vcds);
  fill(ds, ds + n, false);
  ds[0] = true;
  int dn = 1;

  priority_queue<pii> q;
  q.push(pii(-vcds[0].sum(), 0));

  bool gl = false;
  while (! q.empty()) {
    pii up = q.top(); q.pop();
    int us = -up.first, u = up.second;
    if (us >= ucd.sum()) break;
    if (u == n - 1) {
      gl = true;
      break;
    }

    if (dn == 1) ucd.takeone(vcds[u]);
    else ucd.takeall(vcds[u]);

    for (auto v: nbrs[u]) {
      if (! ds[v]) {
	ds[v] = true;
	dn++;
	q.push(pii(-vcds[v].sum(), v));
      }
    }

    if (u == 0 && dn > 1) ucd.takeall(vcds[0]);
  }

  //printf("check(%d) = %d\n", s, gl);
  return gl;
}

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  for (int i = 0; i < n; i++) cds[i].read();

  int s0 = 3, s1 = MAX_S + 1;
  while (s0 + 1 < s1) {
    int s = (s0 + s1) / 2;
    if (check(n, s)) s1 = s;
    else s0 = s;
  }
  //printf("s1=%d\n", s1);

  printf("1 1 %d\n", s1 - 2);
  return 0;
}