1 //It is made by Awson on 2017.9.21
 2 #include <set>
 3 #include <map>
 4 #include <cmath>
 5 #include <ctime>
 6 #include <queue>
 7 #include <stack>
 8 #include <string>
 9 #include <cstdio>
10 #include <vector>
11 #include <cstdlib>
12 #include <cstring>
13 #include <iostream>
14 #include <algorithm>
15 #define Min(a, b) ((a) < (b) ? (a) : (b))
16 #define Max(a, b) ((a) > (b) ? (a) : (b))
17 #define LL long long
18 using namespace std;
19 const int N = 50000;
20 const int M = 100000;
21 LL st[64];
22
23 int n, m, u, v;
24 LL c;
25 struct tt {
26     int to, next;
27     LL cost;
28 }edge[2*M+5];
29 int path[N+5], top;
30 LL d[N+5];
31 LL p[64];
32 bool vis[N+5];
33
34 LL getmax(LL x) {
35     for (int i = 62; i >= 0; i--)
36         if ((x^p[i]) > x)
37             x ^= p[i];
38     return x;
39 }
40 void insert(LL x) {
41     for (int i = 62; i >= 0; i--)
42         if (x&st[i]) {
43             if (!p[i]) {
44                 p[i] = x;
45                 break;
46             }
47             x ^= p[i];
48         }
49 }
50 void add(int u, int v, LL c) {
51     edge[++top].to = v;
52     edge[top].cost = c;
53     edge[top].next = path[u];
54     path[u] = top;
55 }
56 void dfs(int u) {
57     vis[u] = 1;
58     for (int i = path[u]; i; i = edge[i].next) {
59         if (vis[edge[i].to]) insert(d[u]^d[edge[i].to]^edge[i].cost);
60         else {
61             d[edge[i].to] = d[u]^edge[i].cost;
62             dfs(edge[i].to);
63         }
64     }
65 }
66 void work() {
67     st[0] = 1;
68     for (int i = 1; i < 63; i++) st[i] = st[i-1]<<1;
69     for (int i = 1; i <= m; i++) {
70         scanf("%d%d%lld", &u, &v, &c);
71         add(u, v, c); add(v, u, c);
72     }
73     dfs(1);
74     LL ans = getmax(d[n]);
75     printf("%lld\n", ans);
76 }
77 int main() {
78     while (~scanf("%d%d", &n, &m))
79         work();
80     return 0;
81 }