#include <bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;
const int MAX=1e3+5;
vector<int> adj[MAX];
string message = "";
vector<int> L;
void dfs(int x,int p){
for (auto y:adj[x]) if (y!=p) dfs(y,x);
if (x<p) message.push_back('0');
else message.push_back('1');
L.push_back(x);
}
int main() {
int P, N;
cin >> P >> N;
if (P == 1) {
for (int i = 0; i < N - 1; ++i) {
int a,b;cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(0,-1);
L.pop_back();
cout << message << endl;
for (int i = 0; i < N - 1; ++i) {
cout << L[i] << endl;
}
} else {
cin.ignore(100, '\n');
getline(cin, message);
for (int i = 0; i < N - 1; ++i) {
int a,b;cin>>a>>b;
if (message[i]=='0') cout<<min(a,b);
else cout<<max(a,b);
cout<<'\n';
}
}
return 0;
}
