#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cctype>
using namespace std;
typedef long long ll;
const int INF=1e9;
const int N=505,M=1e6+5;
inline int read(){int X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();return w?-X:X;
}
int S,T,n,m;
struct node{int nxt,to,w,b;
}edge[M];
int head[N],cnt=-1;
inline void add(int u,int v,int w,int b){edge[++cnt].to=v;edge[cnt].w=w;edge[cnt].b=b;edge[cnt].nxt=head[u];head[u]=cnt;edge[++cnt].to=u;edge[cnt].w=0;edge[cnt].b=-b;edge[cnt].nxt=head[v];head[v]=cnt;
}
int dis[N];
bool vis[N];
inline bool spfa(int s,int t){deque<int>q;memset(vis,0,sizeof(vis));for(int i=1;i<=n;i++)dis[i]=INF;dis[t]=0;q.push_back(t);vis[t]=1;while(!q.empty()){int u=q.front();q.pop_front();vis[u]=0;for(int i=head[u];i!=-1;i=edge[i].nxt){int v=edge[i].to;int b=edge[i].b;if(edge[i^1].w&&dis[v]>dis[u]-b){dis[v]=dis[u]-b;if(!vis[v]){vis[v]=1;if(!q.empty()&&dis[v]<dis[q.front()]){q.push_front(v);}else{q.push_back(v);}}}}}return dis[s]<INF;
}
int ans,cur[N];
int dfs(int u,int flow,int m){if(u==m){vis[m]=1;return flow;}int res=0,delta;vis[u]=1;for(int &e=cur[u];e!=-1;e=edge[e].nxt){int v=edge[e].to;int b=edge[e].b;if(!vis[v]&&edge[e].w&&dis[u]-b==dis[v]){delta=dfs(v,min(edge[e].w,flow-res),m); if(delta){edge[e].w-=delta;edge[e^1].w+=delta;res+=delta;ans+=delta*b;if(res==flow)break;}}}return res;
}
inline int costflow(){int flow=0;while(spfa(S,T)){do{for(int i=1;i<=n;i++)cur[i]=head[i];memset(vis,0,sizeof(vis));flow+=dfs(S,INF,T);}while(vis[T]);}return flow;
}
int main(){memset(head,-1,sizeof(head));n=read(),m=read(),S=1,T=n;for(int i=2;i<n;i++)add(i,i+n,1,0);for(int i=1;i<=m;i++){int u=read(),v=read(),b=read();if(u==S)add(u,v,1,b);else add(u+n,v,1,b);}n*=2;printf("%d ",costflow());printf("%d\n",ans);return 0;
}