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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;
 
#define REP(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)(a); i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007
#define _SPLIT " "
 
template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T,class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << setprecision(24) << a << endl;}
template<class T,class ...Args> void write(T a, Args... args){cout << setprecision(24) << a << _SPLIT; write(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
template<class T> void warr(T begin, T end, const char* c = " "){cout << *begin;for(auto i = begin+1; i != end; i++)cout << c << *i;cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

struct Edge
{
    vector<int> from;
    vector<int> to;
    vector<int> cost;
    vector<int> from_cost;
    int reach_num=0;
    int rv_reach_num=0;
    int connect_num=0;
    int rv_connect_num=0;
    int min_time=0;
    int max_time=1e9;
};

int main(void)
{
    int n,m;
    read(n,m);
    vector<Edge> e(n);
    rep(i,m){
        int a,b,c;
        read(a,b,c);
        e[a].to.push_back(b);
        e[a].cost.push_back(c);
        e[a].rv_connect_num++;
        e[b].from.push_back(a);
        e[b].from_cost.push_back(c);
        e[b].connect_num++;
    }
    queue<Edge> q;
    q.push(e[0]);
    while(!q.empty()){
        Edge& et=q.front();
        rep(i,et.to.size()){
            int to=et.to[i];
            e[to].reach_num++;
            e[to].min_time=max(e[to].min_time,et.min_time+et.cost[i]);
            if(e[to].reach_num<e[to].connect_num)continue;
            q.push(e[to]);
        }
        q.pop();
    }
    e[n-1].max_time=e[n-1].min_time;
    q.push(e[n-1]);
    int res2=0;
    while(!q.empty()){
        Edge& et=q.front();
        rep(i,et.from.size()){
            int from=et.from[i];
            e[from].rv_reach_num++;
            e[from].max_time=min(e[from].max_time,et.max_time-et.from_cost[i]);
            if(e[from].rv_reach_num<e[from].rv_connect_num)continue;
            q.push(e[from]);
            if(e[from].min_time<e[from].max_time)res2++;
        }
        q.pop();
    }
    int res1=e[n-1].min_time;
    write(res1,to_string(res2)+"/"+to_string(n));
    return 0;
}