Problem: The country Treeland consists of n cities connected with n - 1 bidirectional roads in such a way that it's possible to reach every city starting from any other city using these roads. There will be a soccer championship next year, and all participants are Santa Clauses. There are exactly 2k teams from 2k different cities.

During the first stage all teams are divided into k pairs. Teams of each pair play two games against each other: one in the hometown of the first team, and the other in the hometown of the other team. Thus, each of the 2k cities holds exactly one soccer game. However, it's not decided yet how to divide teams into pairs.

It's also necessary to choose several cities to settle players in. Organizers tend to use as few cities as possible to settle the teams.

Nobody wants to travel too much during the championship, so if a team plays in cities u and v, it wants to live in one of the cities on the shortest path between u and v (maybe, in u or in v). There is another constraint also: the teams from one pair must live in the same city.

Summarizing, the organizers want to divide 2k teams into pairs and settle them in the minimum possible number of cities m in such a way that teams from each pair live in the same city which lies between their hometowns.

Input

The first line of input contains two integers n and k (2 ≤ n ≤ 2·105, 2 ≤ 2k ≤ n) — the number of cities in Treeland and the number of pairs of teams, respectively.

The following n - 1 lines describe roads in Treeland: each of these lines contains two integers a and b (1 ≤ a, b ≤ n, a ≠ b) which mean that there is a road between cities a and b. It's guaranteed that there is a path between any two cities.

The last line contains 2k distinct integers c1, c2, ..., c2k (1 ≤ ci ≤ n), where ci is the hometown of the i-th team. All these numbers are distinct.

Output

The first line of output must contain the only positive integer m which should be equal to the minimum possible number of cities the teams can be settled in.

The second line should contain m distinct numbers d1, d2, ..., dm (1 ≤ di ≤ n) denoting the indices of the cities where the teams should be settled.

The k lines should follow, the j-th of them should contain 3 integers uj, vj and xj, where uj and vj are the hometowns of the j-th pair's teams, and xj is the city they should live in during the tournament. Each of the numbers c1, c2, ..., c2k should occur in all uj's and vj's exactly once. Each of the numbers xj should belong to {d1, d2, ..., dm}.

If there are several possible answers, print any of them.

Example

Input

6 2
1 2
1 3
2 4
2 5
3 6
2 5 4 6


Output

1
2
5 4 2
6 2 2

Note

In the first test the orginizers can settle all the teams in the city number 2. The way to divide all teams into pairs is not important, since all requirements are satisfied anyway, because the city 2 lies on the shortest path between every two cities from {2, 4, 5, 6}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
int n, m, k, len, le, nex[N], nex1[N], wen[N], wen1[N], hea1[N], hea[N], val[N],
    bo[N], root;
struct arr {
  int x, y;
} a[N];
bool cmp(arr xx, arr yy) { return xx.x < yy.x; }
void add(int x, int y) {
  ++len;
  nex[len] = hea[x];
  wen[len] = y;
  hea[x] = len;
}
void dfs(int x, int y) {
  val[x] = bo[x];
  for (int i = hea[x]; i > 0; i = nex[i])
    if (y != wen[i]) dfs(wen[i], x), val[x] += val[wen[i]];
}
void dfs1(int x, int y) {
  if (bo[x] == 1) {
    ++le;
    nex1[le] = hea1[k];
    wen1[le] = x;
    hea1[k] = le;
  }
  for (int i = hea[x]; i > 0; i = nex[i])
    if (y != wen[i]) dfs1(wen[i], x);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n - 1; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    bo[x] = bo[y] = 1;
  }
  root = 1;
  dfs(root, 0);
  int boo;
  do {
    boo = 0;
    for (int i = hea[root]; i > 0; i = nex[i])
      if (val[wen[i]] > m) {
        val[root] -= val[wen[i]];
        val[wen[i]] = m * 2;
        root = wen[i];
        boo = 1;
        break;
      }
  } while (boo);
  printf("1\n%d\n", root);
  for (int i = hea[root]; i > 0; i = nex[i])
    if (val[wen[i]]) {
      ++k;
      a[k].x = val[wen[i]];
      a[k].y = k;
      dfs1(wen[i], root);
    }
  sort(a + 1, a + k + 1, cmp);
  for (int i = 1, j = k; m > 0; m--) {
    if (i == j && m == 1 && a[i].x == 1) {
      printf("%d %d %d\n", wen1[hea1[a[i].y]], root, root);
      return 0;
    }
    --a[i].x;
    --a[j].x;
    printf("%d %d %d\n", wen1[hea1[a[i].y]], wen1[hea1[a[j].y]], root);
    hea1[a[i].y] = nex1[hea1[a[i].y]];
    hea1[a[j].y] = nex1[hea1[a[j].y]];
    while (a[i].x == 0 && i < k) ++i;
    if (a[j].x > 0 && a[j].x < a[i].x) swap(a[i], a[j]);
    if (a[j - 1].x > a[j].x) --j;
    if (a[j + 1].x > a[j].x) ++j;
    while (a[j].x == 0 && j < k) ++j;
    int jj = j;
    if (i == j) {
      ++j;
      while (a[j].x == 0 && j <= k) ++j;
      if (j > k) j = jj;
    }
  }
}