#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
void Joi(int N, int M, int A[], int B[], long long X, int T) {
for(int i = 0; i < 60; i++){
MessageBoard(i, ((X >> i) & 1));
}
for (int i = 60; i < N; i++) MessageBoard(i, 0);
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, m, st;
vector<vector<int>> g;
vector<int> val;
vector<bool> vis;
void dfs(int node) {
vis[node] = true;
for (auto next: g[node]) {
if (vis[next]) continue;
val[next] = Move(next);
dfs(next);
Move(node);
}
}
ll Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
n = N;
m = M;
g.resize(n);
for (int i = 0; i < m; i++) {
int u = A[i], v = B[i];
g[u].push_back(v);
g[v].push_back(u);
}
val.assign(n, -1);
vis.assign(n, false);
st = P;
val[st] = V;
dfs(st);
ll ans = 0;
for (int i = 0; i < 60; i++) {
ans |= ((ll)val[i] << (i));
}
return ans;
}
