// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1); m],
        p: [[u32; 3]; n],
    }
    let mut g = vec![vec![]; n];
    for (a, b) in e {
        g[a].push(b);
        g[b].push(a);
    }
    let mut p = p;
    for p in p.iter_mut() {
        p.sort();
    }
    let p = p;
    let mut ng = p[0].iter().sum::<u32>();
    let mut ok = p.iter().map(|p| p.iter().sum::<u32>()).max().unwrap() + 1;
    while ok - ng > 1 {
        let mid = (ok + ng) / 2;
        let mut hand = vec![1, p[0][2], mid - 2];
        let mut free = vec![];
        free.extend(p[0].iter().take(2).cloned());
        let mut ban = true;
        let mut used = vec![false; n];
        used[0] = true;
        let mut next = BinaryHeap::new();
        for &u in g[0].iter() {
            next.push((!p[u].iter().sum::<u32>(), u));
        }
        while let Some((d, v)) = next.pop() {
            if used[v] {
                continue;
            }
            if !ban {
                hand.append(&mut free);
            }
            hand.sort_by_key(|p| !*p);
            hand.truncate(3);
            let d = !d;
            if hand.iter().sum::<u32>() > d {
                used[v] = true;
                free.extend(p[v].iter());
                ban = false;
                for &u in g[v].iter() {
                    if !used[u] {
                        next.push((!p[u].iter().sum::<u32>(), u));
                    }
                }
            }
        }
        if used[n - 1] {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    println!("1 1 {}", ok - 2);
}

fn main() {
    run();
}