#include <bits/stdc++.h>
using namespace std;
vector <int> adj[2050];
int N=100005;
int vis[100005];
int n,m,v,w,p,ok;
void dfs (int x)
{
    if (vis[x]) return;
    vis[x]=1;
    for (auto u : adj[x]) dfs(u);
}
int main()
{
    while (1)
    {
        ok=1;
        scanf("%d %d",&n,&m);
        if (n==0 || m==0)break;
        for (int i=0;i<m;i++)
        {

            scanf("%d %d %d",&v,&w,&p);
            if (p==1)
            {
                adj[v].push_back(w);
            }
            else
            {
                adj[v].push_back(w);
                adj[w].push_back(v);
            }
        }
        for (int i=1;i<=n;i++)
        {
            memset (vis, 0, sizeof vis);
            dfs(i);
            for (int j=1 ;j<=n;j++)
            {
                if (!vis[j])
                    ok=0;
            }
        }
        for (int i=1;i<=n;i++)
            adj[i].clear();
        printf("%d\n", ok ? 1: 0);

    }
    return 0;
}