#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;
long long mod = 1e9 + 7;
char READ_DATA;
int SIGNAL_INPUT;
template <typename Type>
inline Type ru(Type &v) {
  SIGNAL_INPUT = 1;
  while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
    if (READ_DATA == '-')
      SIGNAL_INPUT = -1;
    else if (READ_DATA == EOF)
      return EOF;
  v = READ_DATA - '0';
  while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9')
    v = v * 10 + READ_DATA - '0';
  v *= SIGNAL_INPUT;
  return v;
}
inline long long modru(long long &v) {
  long long p = 0;
  SIGNAL_INPUT = 1;
  while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
    if (READ_DATA == '-')
      SIGNAL_INPUT = -1;
    else if (READ_DATA == EOF)
      return EOF;
  p = v = READ_DATA - '0';
  while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9') {
    v = (v * 10 + READ_DATA - '0') % mod;
    p = (p * 10 + READ_DATA - '0') % (mod - 1);
  }
  v *= SIGNAL_INPUT;
  return p;
}
template <typename A, typename B>
inline char ru(A &x, B &y) {
  if (ru(x) == EOF) return EOF;
  ru(y);
  return 2;
}
template <typename A, typename B, typename C>
inline char ru(A &x, B &y, C &z) {
  if (ru(x) == EOF) return EOF;
  ru(y);
  ru(z);
  return 3;
}
template <typename A, typename B, typename C, typename D>
inline char ru(A &x, B &y, C &z, D &w) {
  if (ru(x) == EOF) return EOF;
  ru(y);
  ru(z);
  ru(w);
  return 4;
}
struct Edge {
  int u, v, next;
  long long w, cap, flow;
  Edge(int _u = 0, int _v = 0, int nxt = -1, long long _w = 1,
       long long _cap = 0) {
    u = _u;
    v = _v;
    w = _w;
    cap = _cap;
    flow = 0;
    next = nxt;
  }
  int operator<(const Edge &b) const { return w < b.w; }
};
const int maxn = 3e5 + 7;
double eps = 1e-12;
int n, m;
Edge edg[maxn];
int ecnt, g[maxn], d[maxn], sgn[maxn], vis[maxn];
int node, maxlen;
void find(int u, int len) {
  vis[u] = 1;
  if (sgn[u]) {
    if (len > maxlen) {
      node = u;
      maxlen = len;
    } else if (len == maxlen)
      node = min(node, u);
  }
  for (int i = g[u]; ~i; i = edg[i].next) {
    int &v = edg[i].v;
    if (!vis[v]) {
      find(v, len + 1);
    }
  }
  vis[u] = 0;
}
int sum;
int dfs(int u, int fa) {
  int ok = 0, tmp;
  if (sgn[u]) {
    maxlen = max(maxlen, d[u]);
    ok = 1;
  }
  for (int i = g[u]; ~i; i = edg[i].next) {
    int &v = edg[i].v;
    if (v != fa) {
      d[v] = d[u] + 1;
      tmp = dfs(v, u);
      if (tmp) ++sum;
      ok |= tmp;
    }
  }
  return ok;
}
int main() {
  memset(g, ecnt = -1, sizeof(g));
  ru(n, m);
  int u, v;
  for (int i = 1; i < n; ++i) {
    ru(u, v);
    edg[++ecnt] = Edge(u, v, g[u]), g[u] = ecnt;
    edg[++ecnt] = Edge(v, u, g[v]), g[v] = ecnt;
  }
  sgn[ru(node)] = 1;
  while (--m) {
    sgn[ru(u)] = 1;
  }
  find(node, 0);
  maxlen = 0;
  find(node, 0);
  int tmp = node;
  maxlen = 0;
  find(node, 0);
  node = min(node, tmp);
  maxlen = 0;
  dfs(node, -1);
  cout << node << endl << 2 * sum - maxlen;
}
