#include<stdio.h>
long long unsigned n,m,a[100001],b[1000001],c[1000001],d[1000001];
long long unsigned euclid(long long unsigned x,long long unsigned y){
	long long unsigned r;
    do{
        r=x%y;
        x=y;
        y=r;}
	while(r);
	return x;}
long long unsigned check(){
	long long unsigned i;
	for(i=1; i<=m; ++i)
		if(euclid(a[b[i]],a[c[i]])!=d[i])
			return 0;
	return 1;}
void solve(){
	long long unsigned i;
	scanf("%lld%lld",&n,&m);
	for(i=1; i<=n; ++i)
		a[i]=1;
	for(i=1; i<=m; ++i){
		scanf("%lld%lld%lld",&b[i],&c[i],&d[i]);
		a[b[i]]=(a[b[i]]*d[i])/euclid(a[b[i]],d[i]);
		a[c[i]]=(a[c[i]]*d[i])/euclid(a[c[i]],d[i]);}
    if(!check())
        printf("-1");
    else
        for(i=1; i<=n; ++i)
            printf("%lld ",a[i]);}
int main(){
    freopen("oz.in","r",stdin);
    freopen("oz.out","w",stdout);
    solve();
    return 0;}