/// In The Name Of God
#include <bits/stdc++.h>
#include "Joi.h"
#define ioi exit(0);
using namespace std;
class Solve1 {
static const int N = 2e5 + 7;
int n, m, T;
long long x;
int *a, *b;
int cnt;
vector <int> g[N];
bool was[N];
public:
Solve1() {}
Solve1(int n, int m, int a[], int b[], long long x, int T) :
n(n), m(m), a(a), b(b), x(x), T(T) {}
void dfs(int v = 0) {
was[v] = 1;
if (cnt <= 59) {
int type = (x & (1LL << cnt)) > 0;
MessageBoard(v, type);
}
else {
MessageBoard(v, 0);
}
++cnt;
for (auto to : g[v]) {
if (!was[to]) {
dfs(to);
}
}
}
void solve() {
for (int i = 0; i < m; i++) {
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
dfs();
}
} S1;
void Joi(int n, int m, int a[], int b[], long long x, int T) {
S1 = Solve1(n, m, a, b, x, T);
S1.solve();
}
/*int32_t main() {
}
*/
/*int32_t main() {
S1.solve();
ioi
}*/
/*int32_t main() {
return 0;
}*/
/*#ifdef IOI2018
int main() {
freopen ("in.txt", "r", stdin);
ioi
}
#endif
*/
/// In The Name Of God
#include "Ioi.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
static const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
using namespace std;
vector <int> g[N];
ll res;
int last;
bool found;
bool was[N];
void dfs(int v) {
was[v] = 1;
if (found || !v) {
found = 1;
return;
}
for (auto to : g[v]) {
if (!was[to] && !found) {
last = Move(to);
dfs(to);
if (!found) last = Move(v);
}
}
}
int cnt;
void dfs1(int v) {
was[v] = 1;
if (cnt <= 59) {
res += (1LL << cnt) * last;
}
cnt++;
for (auto to : g[v]) {
if (!was[to]) {
last = Move(to);
dfs1(to);
Move(v);
}
}
}
ll Ioi(int n, int m, int a[], int b[], int p, int v, int t) {
for (int i = 0; i < m; i++) {
g[a[i]].pb(b[i]);
g[b[i]].pb(a[i]);
}
last = v;
dfs(p);
memset(was, 0, sizeof(was));
dfs1(0);
return res;
}
/*#ifdef IOI2018
int main() {
freopen ("in.txt", "r", stdin);
ioi
}
#endif*/
