#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e4 + 7 ;

int n , m ;
vector < pii > v[ MAXN ] ;
ll lvl[ MAXN ] ;
struct edge {
    int x , y , len ;
};
edge hh[ MAXN ] ;

ll cycle_len = -1 ;

int used[ MAXN ] ;
void dfs ( int x , int prv ) {
    used[ x ] = 1 ;
    for ( auto [ y , id ] : v[ x ] ) {
        if ( y == prv ) { continue ; }
        int len = hh[ id ].len ;
        if ( used[ y ] == 0 ) {
            lvl[ y ] = lvl[ x ] + len ;
            if ( hh[ id ].x != x ) { swap ( hh[ id ].x , hh[ id ].y ) ; }
            dfs ( y , x ) ;
        }
        else {
            if ( used[ y ] == 1 ) {
                if ( hh[ id ].x != x ) { swap ( hh[ id ].x , hh[ id ].y ) ; }
                if ( cycle_len < 0 ) { cycle_len = len + lvl[ x ] - lvl[ y ] ; }
            }
        }
    }
    used[ x ] = 2 ; 
}

bool f ( ll cand ) {
    for ( int i = 1 ; i <= m ; ++ i ) {
        ll sr = ( lvl[ hh[ i ].x ] + hh[ i ].len ) % cand ;
        if ( sr != ( lvl[ hh[ i ].y ] % cand ) ) { return false ; }
    }
    return true ;
}

void solve ( ) {
    cin >> n >> m ;
    for ( int i = 1 ; i <= m ; ++ i ) {
        cin >> hh[ i ].x >> hh[ i ].y >> hh[ i ].len ;
        v[ hh[ i ].x ].push_back ( { hh[ i ].y , i } ) ;
        v[ hh[ i ].y ].push_back ( { hh[ i ].x , i } ) ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( used[ i ] == 0 ) { 
            dfs ( i , -1 ) ;
        }
    }
    if ( cycle_len < 0 ) {
        cout << "0\n" ;
        return ;
    }
    vector < ll > divs ;
    for ( ll i = 1 ; i * i <= cycle_len ; ++ i ) {
        if ( ( cycle_len % i ) == 0 ) {
            divs.push_back ( i ) ;
            if ( i * i != cycle_len ) { divs.push_back ( cycle_len / i ) ; }
        }
    }
    sort ( divs.begin ( ) , divs.end ( ) , greater < ll > ( ) ) ;
    for ( auto x : divs ) {
        if ( f ( x ) == true ) {
            cout << x << "\n" ;
            return ;
        }
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}