#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n,m;cin >> n >>m; vvl mat(n,vl(n,INF)); rep(i,n)mat[i][i]=0; rep(i,m){ ll a,b,w;cin >> a >> b >> w;a--;b--; mat[a][b]=w; } rep(k,n)rep(i,n)rep(j,n)mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]); rep(i,n){ ll ans=0; rep(j,n){ if(mat[i][j]==INF)continue; ans+=mat[i][j]; } cout << ans <