#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

int main(){
    int n,m; cin>>n>>m;

    vvi e(n);
    rep(i,m){
        int a,b; cin>>a>>b;
        a--; b--;
        e[a].pb(b);
        e[b].pb(a);
    }

    vvl abc(n,vl(3));
    vl atmp(n),btmp(n),ctmp(n);
    vl nabc(3);

    rep(i,n){
        cin>>abc[i][0]>>abc[i][1]>>abc[i][2];
        atmp[i] = abc[i][0];
        btmp[i] = abc[i][1];
        ctmp[i] = abc[i][2];
    }

    ll l = 0,u = 3e8+1;


    auto check = [&](ll x) -> bool{
        bool ret;

        if (x <= 2) return false;

        rep(i,n) abc[i][0] = atmp[i];
        rep(i,n) abc[i][1] = btmp[i];
        rep(i,n) abc[i][2] = ctmp[i];

        nabc[0] = x - 2;
        nabc[1] = 1;
        nabc[2] = 1;

        mpq<pli> q;
        vb flg(n);

        q.push({abc[0][0] + abc[0][1] + abc[0][2] , 0});

        while(!q.empty()){
            pli p = q.top();
            q.pop();

            ll sum = 0;
            rep(i,3) sum += nabc[i];

            if (sum <= p.fi){
                ret = false;
                break;
            }

            if (p.se == n-1){
                ret = true;
                break;
            }

            ll mx = 0;
            int mxi;
            ll mn = LINF;
            int mni;

            rep(i,3) if (chmax(mx , abc[p.se][i])) mxi = i;
            rep(i,3) if (chmin(mn , nabc[i])) mni = i;
            
            if (mx > mn){
                swap(abc[p.se][mxi] , nabc[mni]);
                flg[p.se] = false;
            }

            fore(y , e[p.se]){
                if (!flg[y]){
                    q.push({abc[y][0] + abc[y][1] + abc[y][2] , y});
                    flg[y] = true;
                }
            }
        }

        return ret;
    };

    while(u - l > 1){
        ll mid = (u+l)/2;

        if (check(mid)) u = mid;
        else l = mid;
    }

    deb3(u-2 , 1 , 1);

    return 0;
}