#include <iostream>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
ll gcd(ll a,ll b){
	if (b==0)return a;
	return gcd(b,a%b);
}
int n,m,u[1000005],v[1000005],w[1000005],first[1000005],nxt[1000005];
ll depth[1000005];
ll ans;
void dfs(int now,int fa,ll d){
	depth[now]=d;
	for (int i=first[now];i;i=nxt[i]){
		if (v[i]==fa)continue;
		if (depth[v[i]]==0)dfs(v[i],now,d+w[i]);
		else if (depth[v[i]]<depth[now])ans=gcd(ans,depth[now]-depth[v[i]]+w[i]);
	}
	return;
}
int main(){
	cin>>n>>m;
	for (int i=1;i<=m;i++){
		scanf("%d%d%d",&u[i],&v[i],&w[i]);
		nxt[i]=first[u[i]],first[u[i]]=i;
		u[i+m]=v[i],v[i+m]=u[i],w[i+m]=w[i];
		nxt[i+m]=first[u[i+m]],first[u[i+m]]=i+m;
	}
	for (int i=1;i<=n;i++){
		memset(depth,0,sizeof(depth));
		dfs(i,0,114514);
	}
	cout<<ans<<endl;
	return 0;
}