#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,ll>> vertex[100010];
vector<pair<int,ll>> vertex_rev[100010];

ll dpc[100010];
ll dpl[100010];
ll dp2[100010];
ll dph[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);
    }
    
    ll from,to,tick,cost;
    
    queue<vector<int>> q;
    q.push(vector<int>{0});
    while (!q.empty()){
        vector<int>& vref = q.front();
        from = vref[0];
        q.pop();
        
        for (auto p : vertex[from]){
            to = p.first;
            cost = p.second;
            dpl[to] = max(dpl[to],dpl[from]+cost);
            dpc[to]++;
            if (dpc[to]==vertex_rev[to].size()) 
                q.push(vector<int>{to});
        }
        
    }
    fill(dpc,dpc+n,0);
    fill(dph,dph+n,E107);
    
    dph[n-1] = dpl[n-1];
    q.push(vector<int>{n-1});
    while (!q.empty()){
        vector<int>& vref = q.front();
        from = vref[0];
        q.pop();
        
        //if (dpc[from]!=vertex[from].size()) continue;
        //dpc[from]++;
        
        for (auto p : vertex_rev[from]){
            to = p.first;
            cost = p.second;
            //printf("%d<-%d %d\n",from,to,vertex[from].size());
            dph[to] = min(dph[to],dph[from]-cost);
            dpc[to]++;
            if (dpc[to]==vertex[to].size())
                q.push(vector<int>{to});
        }
        
    }
    
    
    int work=1;
    
    for (i=1;i<n;i++){
        work+=dpl[i]==dph[i];
    }
    //debuga(dpl,9)
    //debuga(dph,9)
    
    printf("%lld %lld/%lld\n",dpl[n-1],n-work,n);
    

    return 0;
}