#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, st, u, v, head[400001], pos, f[200001], siz[200001], ans[200001], sum[200001];
struct edge
{
    int u, v, next;
} e[400001];
void add(int u, int v)
{
    e[++pos] = {u, v, head[u]};
    head[u] = pos;
}
vector<int> a[200001];
int read()
{
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
void dfs(int x)
{
    vector<pair<double, int>> aa;
    for (auto y : a[x])
    {
        dfs(y);
        aa.emplace_back((double)sum[y] / siz[y], y);
    }
    sort(aa.begin(), aa.end());
    for (auto y : aa)
    {
        ans[x] += siz[x] * sum[y.second] + ans[y.second];
        siz[x] += siz[y.second];
        sum[x] += sum[y.second];
    }
}
void solve()
{
    int vis[11], maxn = 0;
    vis[1] = st;
    bool viss[11];
    for (int i = 1; i <= n; i++)
    {
        if (i == st)
            continue;
        if (i < st)
            vis[i + 1] = i;
        else
            vis[i] = i;
    }
    
    do
    {
        int ans = 0;
        memset(viss, 0, sizeof(viss));
        if (vis[1] != st)
            break;
        //cout<<"yuanshen\n";
        for (int i = 1; i <= n; i++)
        {
            viss[vis[i]] = true;
            ans += vis[i] * i;
            //cout<<vis[i]<<' '<<f[vis[i]]<<ans<<endl;
            if(i==1)
                continue;
            if (!viss[f[vis[i]]])
            {
                ans = -1e18;
                break;
            }
        }
        maxn = max(maxn, ans);
    } while (next_permutation(vis + 1, vis + n + 1));
    printf("%lld", maxn);
}
void dfss(int u, int fa)
{
    if (fa)
    {
        f[u] = fa;
        a[fa].push_back(u);
    }
    // cout<<fa<<' '<<u<<endl;
    for (int i = head[u]; i; i = e[i].next)
    {
        int v = e[i].v;
        if (v == fa)
            continue;
        dfss(v, u);
    }
}
signed main()
{
    n = read();
    st = read();
    for (int i = 1; i <= n; i++)
    {
        ans[i] = sum[i] = i;
        siz[i] = 1;
    }
    for (int i = 2; i <= n; i++)
    {
        u = read();
        v = read();
        add(u, v);
        add(v, u);
    }
    dfss(st, 0);
    if (n > 10)
    {
        dfs(st);
        printf("%lld\n", ans[st]);
    }
    else
    {
        solve();
    }
    return 0;
}