#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e5+5,mod1=1e9+7,mod2=998244353;
typedef pair<int,int> pi;
int a[N][40];
int st[N][40];
int n,m;
vector<pi>g[100005];
map<int,int>mp;
int dfs(int u,int x,int i)
{
    mp[u]=1;
    st[u][i]=1;
    a[u][i]=x;
    int ans=x;
    for(auto [v,w]:g[u])
    {
        int y=(w>>i)&1;
        if(st[v][i])
        {
            int z=(a[v][i])&1;
            if(x^y!=z)return -1;
        }
        else
        {
            a[v][i]=x^y;
            int xx=dfs(v,a[v][i],i);
            if(xx==-1)return -1;
            ans+=xx;
        }
    }
    return ans;
}
void solve()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,w;
        cin>>x>>y>>w;
        g[x].pb({y,w});
        g[y].pb({x,w});
    }
    int ans=0;
    //cout<<dfs(1,0,0)<<'\n';
    //cout<<a[3][0]<<'\n';
    for(int i=1;i<=n;i++)
    {
        if(mp.count(i))continue;
        for(int j=0;j<=30;j++)
        {
            int ans1=dfs(i,0,j);
            memset(st,0,sizeof st);
            int ans2=dfs(i,1,j);
            memset(st,0,sizeof st);
            //cout<<ans1<<' '<<ans2<<'\n';
            if(ans1==-1&&ans2==-1)
            {
                cout<<-1;
                return ;
            }
            if(ans1==-1)ans+=(ans2<<j);
            else if(ans2==-1)ans+=(ans1<<j);
            else ans+=(min(ans1,ans2)<<j);
        }
    }
    cout<<ans;
}
signed main()
{
    io;
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}