#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
struct UF{
vector<int> p;
vector<int> sz;
UF(int n) : p(n,-1), sz(n,1){}
int find(int a){
if(p[a] == -1) return a;
else return p[a] = find(p[a]);
}
bool combine(int a, int b){
a = find(a);
b = find(b);
if(a == b) return false;
p[b] = a;
sz[a] += sz[b];
return true;
}
};
void dfs(vector<vector<int>>& adj, int x, int p,vector<vector<int>>& ans, int k){
ans.push_back(vector<int>(k,x));
for(auto child : adj[x]){
if(child == p) continue;
dfs(adj,child,x,ans,k);
ans.push_back(vector<int>(k,x));
}
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
UF uf(N);
vector<vector<int>> spantree(N);
for(int i = 0; i< M; i++){
if(uf.combine(A[i],B[i])){
spantree[A[i]-1].push_back(B[i]-1);
spantree[B[i]-1].push_back(A[i]-1);
}
}
int k = N*2 -1;
vector<vector<int>> ans;
return ans;
}
