#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int us[1000010],vs[1000010],ws[1000010];
struct Edge{int v,w;
};
vector<Edge>G[100010];
vector<int>rG[100010],tv;
bool used[100010];
int cmp[100010];
int ru[100010],f[100010],ansa[100010];
int n,m;
void AddEdge(int U,int V,int W){G[U].push_back((Edge){V,W});rG[V].push_back(U);
}
void dfs(int U){used[U]=1;for(int i=0;i<G[U].size();++i){if(!used[G[U][i].v]){dfs(G[U][i].v);}}tv.push_back(U);
}
void rdfs(int U,int K){used[U]=1;cmp[U]=K;for(int i=0;i<rG[U].size();++i){if(!used[rG[U][i]]){rdfs(rG[U][i],K);}}
}
int scc(){memset(used,0,sizeof(used));tv.clear();for(int i=1;i<=n;++i){if(!used[i]){dfs(i);}}memset(used,0,sizeof(used));int K=0;for(int i=tv.size()-1;i>=0;--i){if(!used[tv[i]]){rdfs(tv[i],++K);}}return K;
}
int main(){int x,y,z;scanf("%d%d",&n,&m);for(int i=1;i<=m;++i){scanf("%d%d%d",&us[i],&vs[i],&ws[i]);AddEdge(vs[i],us[i],ws[i]);}int sccs=scc();for(int i=1;i<=m;++i){if(cmp[vs[i]]==cmp[us[i]] && ws[i]>0){puts("-1");return 0;}}for(int i=1;i<=n;++i){G[i].clear();}for(int i=1;i<=m;++i){if(cmp[vs[i]]!=cmp[us[i]]){++ru[cmp[us[i]]];G[cmp[vs[i]]].push_back((Edge){cmp[us[i]],ws[i]});}}queue<int>q;for(int i=1;i<=sccs;++i){if(!ru[i]){q.push(i);}}while(!q.empty()){int U=q.front(); q.pop();for(int i=0;i<G[U].size();++i){f[G[U][i].v]=max(f[G[U][i].v],f[U]+G[U][i].w);--ru[G[U][i].v];if(!ru[G[U][i].v]){q.push(G[U][i].v);}}}if(*max_element(f+1,f+sccs+1)>100){puts("-1");return 0;}for(int i=1;i<=n;++i){ansa[i]=f[cmp[i]];}for(int i=1;i<=n;++i){G[i].clear();rG[i].clear();}for(int i=1;i<=m;++i){AddEdge(us[i],vs[i],-ws[i]);}sccs=scc();for(int i=1;i<=m;++i){if(cmp[us[i]]==cmp[vs[i]] && ws[i]<0){puts("-1");return 0;}}for(int i=1;i<=n;++i){G[i].clear();}for(int i=1;i<=m;++i){if(cmp[us[i]]!=cmp[vs[i]]){++ru[cmp[vs[i]]];G[cmp[us[i]]].push_back((Edge){cmp[vs[i]],-ws[i]});}}memset(f,0x7f,sizeof(f));for(int i=1;i<=sccs;++i){if(!ru[i]){q.push(i);f[i]=100;}}while(!q.empty()){int U=q.front(); q.pop();for(int i=0;i<G[U].size();++i){f[G[U][i].v]=min(f[G[U][i].v],f[U]+G[U][i].w);--ru[G[U][i].v];if(!ru[G[U][i].v]){q.push(G[U][i].v);}}}if(*min_element(f+1,f+sccs+1)<0){puts("-1");return 0;}for(int i=1;i<=n;++i){printf("%d %d\n",ansa[i],f[cmp[i]]);}return 0;
}