#include "testlib.h"
#include <bits/stdc++.h>
#include <queue>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

const ll MIN_N = 3, MAX_N = 20'000;
const ll MIN_Q = 1, MAX_Q = 10'000;
#define space inf.readSpace()

int main(int argc, char **argv) {
  registerValidation(argc, argv);
  ll N = inf.readLong(MIN_N, MAX_N);
  space;
  int Q = inf.readLong(MIN_Q, min(MAX_Q, N * (N - 1) / 2));
  inf.readEoln();
  vector G(N, vi());
  set<pii> edge;
  rep(N - 1) {
    int A = inf.readInt(0, N - 1);
    space;
    int B = inf.readInt(0, N - 1);
    inf.readEoln();
    ensure(A != B);
    G[A].push_back(B);
    G[B].push_back(A);
    if (A > B)
      swap(A, B);
    ensure(!edge.contains(pii{A, B}));
    edge.insert(pii{A, B});
  }
  {
    vi connec(N);
    queue<int> bfs;
    bfs.push(0);
    connec[0] = 1;
    while (!bfs.empty()) {
      int v = bfs.front();
      bfs.pop();
      for (auto u : G[v]) {
        if (!connec[u]) {
          connec[u] = 1;
          bfs.push(u);
        }
      }
    }
    rep(i, N) ensure(connec[i]);
  }
  cout << string(N - 1, '0') << endl;
  rep(Q) {
    int C = inf.readInt(0, N - 1);
    space;
    int D = inf.readInt(0, N - 1);
    inf.readEoln();
    if (C > D)
      swap(C, D);
    ensure(!edge.contains(pii{C, D}));
    edge.insert(pii{C, D});
    cout << "0" << endl;
  }
  inf.readEof();
}