#include <bits/stdc++.h>
using namespace std;

using pii = pair<int,int>;
using ll = long long;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)
#define all(v) v.begin(),v.end()
#define debug(x) cerr << #x << " : " << x << endl

template<class T> bool set_min(T &a, const T &b) { return a > b  ? a = b, true : false; }
template<class T> bool set_max(T &a, const T &b) { return a < b  ? a = b, true : false; }
// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; }

const int INF = 1 << 30;
const ll INFL = 1LL << 60;


class Solver {
  public:
    int N, M;
    vector<vector<pii>> E;
    vector<vector<pii>> RE;

    vector<int> earliest, latest;
    
    int calc_earliest(int now) {
        if(earliest[now] >= 0) return earliest[now];
        int res = 0;
        for(auto e : RE[now]) {                
            set_max(res, calc_earliest(e.first) + e.second);
        }
        return earliest[now] = res;
    }

    int calc_latest(int now) {
        if(latest[now] < INF) return latest[now];
        int res = earliest[N - 1];
        for(auto e: E[now]) {
            set_min(res, calc_latest(e.first) - e.second);
        }
        return latest[now] = res;
    }
    
    vector<int> calc_critical_path(const vector<int> &earliest, const vector<int> &latest) {
        vector<int> ret;
        int now = N - 1;
        while(now != 0) {
            ret.push_back(now);
            int nxt = -1;
            for(auto e : RE[now]) {
                if(earliest[e.first] == latest[e.first]) {
                    nxt = e.first;
                    break;
                }
            }
            assert(nxt >= 0);
            now = nxt;
        }
        ret.push_back(now);
        return ret;
    }
    
    bool solve() {
        cin >> N >> M;
        E.resize(N);
        RE.resize(N);
        
        rep(i, M) {
            int a, b, c; cin >> a >> b >> c;
            E[a].push_back(make_pair(b, c));
            RE[b].push_back(make_pair(a, c));
        }
        
        earliest.resize(N, -1);
        latest.resize(N, INF);

        calc_earliest(N - 1);
        calc_latest(0);
        
        //cerr << earliest << endl;
        //cerr << latest << endl;
        //cerr << calc_critical_path(earliest, latest) << endl;

        int T = earliest[N - 1];
        int P = N - calc_critical_path(earliest, latest).size();

        cout << T << " " << P << "/" << N << endl;
        
        return 0;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Solver s;
    s.solve();
    return 0;
}