#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int width,height;
int m,n;

vector<pair<int,int>> vertex[100010];
//vector<pair<int,int>> vertex_rev[100010];

int dp[100010];
int dp2[100010];

int main(){
    int i,j,k;
    int x,y,a,b;
    
    cin>>n>>m;
    
    for (i=0;i<m;i++){
        scanf("%d%d%d",&a,&b,&x);
        vertex[a].emplace_back(b,x);
        //vertex_rev[b].emplace_back(a,x);
    }
    
    priority_queue<vector<int>> pq;
    pq.push(vector<int>{0,0});
    
    int from,to,tick,cost,num;
    
    while (!pq.empty()){
        const vector<int>& vref=pq.top();
        tick = vref[0];
        from = vref[1];
        pq.pop();
        
        if (tick < dp[from]) continue;
        if (from == n-1){
        }
        
        for (auto p_to : vertex[from]){
            to = p_to.first;
            cost = p_to.second;
            if (dp[to] < tick + cost){
                dp[to] = tick + cost;
                pq.push(vector<int>{tick+cost,to});
            }
        }
    }
    
    pq.push(vector<int>{0,0});
    while (!pq.empty()){
        const vector<int>& vref=pq.top();
        tick = -vref[0];
        from = vref[1];
        pq.pop();
        
        if (dp2[from] < tick) continue;
        if (from == n-1){
        }
        
        for (auto p_to : vertex[from]){
            to = p_to.first;
            cost = p_to.second;
            if (!dp2[to]||dp2[to] > tick + cost){
                dp2[to] = tick + cost;
                pq.push(vector<int>{-dp2[to],to});
            }
        }
    }
    int work=0;
    
    for (i=0;i<n;i++){
        work+=dp[i]==dp2[i];
    }
    //debuga(dp,9)
    //debuga(dp2,9)
    
    printf("%d %d/%d\n",dp[n-1],n-work,n);
    

    return 0;
}