#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair<int, ll> PII;

const int N = ;

int n, m, cnt;

vector<PII> G[N];

ll a[N], d[N];

int used[N];

void gauss()

{

    int now = ;

    for(int i = ; i >= ; --i)

    {

        bool flag = false;

        for(int j = now; j <= cnt; ++j)

            if(a[j] & (1ll << i))

            {

                swap(a[j], a[now]);

                flag = true;

                break;

            }

        if(!flag) continue;

        for(int j = ; j <= cnt; ++j) if((a[j] & (1ll << i)) && j != now)

            a[j] ^= a[now];

        ++now;

    }

    --now;

}

void dfs(int u, int last)

{

    used[u] = ;

    for(int i = ; i < G[u].size(); ++i)

    {

        PII x = G[u][i];

        int v = x.first;

        ll w = x.second;

        if(v == last) continue;

        if(!used[v])

        {

            d[v] = d[u] ^ w;

            dfs(v, u);

        }

        else a[++cnt] = d[v] ^ d[u] ^ w;

    }

}

int main()

{

    scanf("%d%d", &n, &m);

    for(int i = ; i <= m; ++i)

    {

        int u, v;

        ll w;

        scanf("%d%d%lld", &u, &v, &w);

        G[u].push_back(make_pair(v, w));

        G[v].push_back(make_pair(u, w));

    }

    dfs(, );

    ll ans = d[n];

    gauss();

    for(int i = ; i <=  && i <= cnt; ++i) if((ans ^ a[i]) > ans)

        ans ^= a[i];

    printf("%lld\n", ans);

    return ;

}