#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>; 
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define fi first 
#define se second
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define set20 cout<<fixed<<setprecision(20) ;
// ミント
//int mod ; cin>>mod ;
const ll mod = 1e9+7 ;//924844033;  
    //998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
//昆布
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod); //任意modではここ消す
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n,int k){
    return fact[n]*ifact[n-k] ; //kは個数
  }
  }  c(1000005);
 
mint modpow(ll a,ll b){
 if(b==0) return 1 ;
 mint c= modpow(a,b/2) ;
 if(b%2==1) return c*c*a ;
 else return c*c ;
}
 
mint komb(ll n,ll m){
  mint x=1 ;mint y=1 ;
  rep(i,m){
    x*= n-i ;
    y*= i+1 ;
  }
  return x/y ;
}
 
 
 map<ll,ll> factor(ll n){  //素因数とオーダーをマップで管理
  map <ll,ll> ord ;  
  for(ll i=2;i*i<=n;i++){
        if(n%i==0){
            int res=0;
            while(n%i==0){
                n/=i;
                res++;
            }
            ord[i]=res;
        }
    }
   if(n!=1) ord[n]++;
   return ord ;
 }
 

int main(){
  ios::sync_with_stdio(false) ;
  cin.tie(nullptr) ; 
  ll n ; cin>>n ;
  string s ; cin>>s ;
  if(s[0]!=s[n-1]) cout<<1<<endl ;
  else{
    char a=s[0] ;
    bool ok=0 ;
    rep(i,n-1){
     if(s[i]!=a && s[i+1]!=a) ok=1 ;
    }
    if(ok) cout<<2<<endl ;
    else cout<<-1<<endl ;
  }
  return 0 ;
  }
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
const int N=2000;
const int INF=1e9;
const int White=0,Gray=1,Black=2;
vector<P> G[N];
int dist[N][N];
int color[N], self[N];
priority_queue<P,vector<P>, greater<P>> que;
void dijkstra(int v){
  que.push({0,v});
  color[v]=Gray;
  while(!que.empty()){
    P now=que.top();que.pop();
    if(dist[v][now.second]<now.first)continue;
    color[now.second]=Black;
    for (auto &&i : G[now.second]){
      int d=i.first, next=i.second;
      if(color[next]==Black)continue;
      if(dist[v][next] > dist[v][now.second]+d) {
        dist[v][next] = dist[v][now.second]+d;
        que.push({dist[v][next],next});
        color[next]=Gray;
      }
    }
    
  }
}
int main() {
  int n,m;
  cin >> n >> m;
  rep(i,n)self[i]=INF;
  rep(i,m) {
    int ai, bi, ci;
    cin >> ai >> bi >> ci;
    ai--; bi--;
    if(ai==bi){
      self[ai]=min(self[ai],ci);
      continue;
    }
    G[ai].push_back({ci,bi});
  }
  rep(i,n)rep(j,n)dist[i][j]=INF;
  rep(i,n)dist[i][i]=0;

  rep(j,n){
    rep(k,n)color[k] = White;
    dijkstra(j);
  }
  rep(i,n) {
    int ans = INF;
    rep(j,n) {
      if(i==j){
        ans=min(ans,self[i]);
        continue;
      }
      ans = min(ans,dist[i][j]+dist[j][i]);
    }
    cout << ((ans==INF) ? -1 : ans)<< endl;
  }
}