#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

long long ans = 0;
int N, S, cid = 0;
int u, v;
vector<int> E[100005];
priority_queue<int, vector<int>, greater<int> > q;
int fa[100005];
bool vis[15];

void erg(int u){
	for (auto && v : E[u]){
		if (v == fa[u]) continue;
		fa[v] = u;
		erg(v);
	}
}

void dfs(int k, int sum){
	if (k == N){
		ans = max(ans, 1LL * sum);
		return;
	}
	for (int i = 1; i <= N; i ++){
		if (vis[i]) continue;
		if (vis[fa[i]] == 0) continue;
		vis[i] = 1;
		dfs(k + 1, sum + (k + 1) * i);
		vis[i] = 0;
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %d", &N, &S);
	for (int i = 1; i < N; i ++){
		scanf("%d %d", &u, &v);
		E[u].push_back(v);
		E[v].push_back(u);
	}
	erg(S);
	if (N <= 10){
		vis[S] = 1;
		dfs(1, S);
		printf("%lld\n", ans);
		return 0;
	}
	q.push(S);
	while (!q.empty()){
		int u = q.top();
		q.pop();
		cid ++;
		ans += 1LL * u * cid;
		for (auto && v : E[u]){
			if (v == fa[u]) continue;
			q.push(v);
		}
	}
	printf("%lld\n", ans);

	return 0;
}