#include <cstdio>
#include <algorithm>
#define X first
#define Y second
using namespace std;
long long n,k,i,j,Div[100005],a[10005],x,y;
pair <long long,long long> v[100005];
bool ok=true;
long long cmmdc(long long a,long long b)
{
    int r;
    r=a%b;
    while (r!=0)
    {
        a=b;
        b=r;
        r=a%b;
    }
    return b;
}
int main()
{
    freopen("oz.in","r",stdin);
    freopen("oz.out","w",stdout);
    scanf("%lld %lld\n",&n,&k);
    for (i=1; i<=n; i++)
        a[i]=1;
    for (i=1; i<=k; i++)
    {
        scanf("%lld %lld %lld",&v[i].X,&v[i].Y,&Div[i]);
        x=cmmdc(Div[i],a[v[i].X]);
        y=cmmdc(Div[i],a[v[i].Y]);
        a[v[i].X]*=1LL*(Div[i]/x);
        a[v[i].Y]*=1LL*(Div[i]/y);
    }
    for (i=1; i<=k; i++)
        if (cmmdc(a[v[i].X],a[v[i].Y])!=Div[i]||a[i]>2000000000)
        {
            printf("-1\n");
            ok=false;
            break;
        }
    if (ok==true)
    {
        for (i=1; i<=n; i++)
            printf("%lld ",a[i]);
        printf("\n");
    }
    return 0;
}