#include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pair<int,int>
#define Pdd pair<double,double>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define dem(a,b) ((a+b-1)/(b))
#define INF 3000000000000000000 // 3.0*10^18
#define MAX LLONG_MAX
#define PI acos(-1.0L)
//int MOD = 998244353; // case
const int MOD = 1000000007; // 10^9 + 7
const double EPS = 1e-10;

using namespace std;

struct mint{int x;mint(int x=0):x((x%MOD+MOD)%MOD){}
mint operator-()const{return mint(-x);}
mint& operator+=(const mint a){if((x+=a.x)>=MOD)x-=MOD;return*this;}
mint& operator-=(const mint a){if((x+=MOD-a.x)>=MOD)x-=MOD;return*this;}
mint& operator*=(const mint a){(x*=a.x)%=MOD;return*this;}
mint operator+(const mint a)const{return mint(*this)+=a;}
mint operator-(const mint a)const{return mint(*this)-=a;}
mint operator*(const mint a)const{return mint(*this)*=a;}
mint pow(int t)const{if(!t)return 1;mint a=pow(t>>1);a*=a;if(t&1)a*=*this;return a;}
mint inv()const{return pow(MOD-2);}
mint& operator/=(const mint a){return*this*=a.inv();}
mint operator/(const mint a)const{return mint(*this)/=a;}};
istream& operator>>(istream& is, const mint& a) {return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) {return os << a.x;}

/* debug */
template <typename T> // vector
ostream& operator<<(ostream& os,const vector<T> &V){int N=V.size();
if(N==0){os<<'.';return os;}rep(i,0,N-1){os<<V[i]<<' ';}os<<V[N-1];return os;}
template <typename T> // vector vector
ostream& operator<<(ostream& os,const vector<vector<T>> &V){
int N=V.size();rep(i,0,N-1)cout<<V[i]<<endl;cout<<V[N-1];return os;}
template <typename T,typename S> // pair
ostream& operator<<(ostream& os, pair<T,S> const&P){os<<P.FI<<' '<<P.SE;return os;}
template <typename T> // set
ostream& operator<<(ostream& os,set<T> &S){auto it=S.begin();while(it!=S.end()){
os<<*it;if(next(it,1)!=S.end())os<<' ';it++;};return os;}
template <typename T> // deque
ostream& operator<<(ostream& os, deque<T> &q){for(auto it=q.begin();it<q.end();it++){
os<<*it;if(it+1!=q.end())os<<" ";}return os;}

/* useful */
template<typename T>void Vin(vector<T> &v){int n=v.size();rep(i,0,n)cin>>v[i];}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){if(r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
Vi vis(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}
int digitsum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}
int digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';} // i桁目の数字
template<typename T>void press(T &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
Vi zip(Vi b){int Z=b.size(); // 座標圧縮
Pii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)
p[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)
{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}
Vi nibe2V(){Vi a(63);int q = 1;rep(i,0,63){a[i]=q;q*=2;}return a;}
Vi nibe = nibe2V(); // 2^n
int modiv(int a,int b){return a*mypow(b,MOD-2,MOD)%MOD;} // a÷b(%MOD)
int SMALLER(Vi &a,int x){return lower_bound(a.begin(),a.end(),x)-a.begin();}
int orSMALLER(Vi &a,int x){return upper_bound(a.begin(),a.end(),x)-a.begin();}
int BIGGER(Vi &a,int x){return a.size()-orSMALLER(a,x);}
int orBIGGER(Vi &a,int x){return a.size()-SMALLER(a,x);}
int COUNT(Vi &a,int x) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}
int maxind(Vi &a){return max_element(ALL(a))-a.begin();}
int minind(Vi &a){return min_element(ALL(a))-a.begin();}
Vi stpowV(){Vi a(1000005);a[0]=1;repeq(i,1,1000004)a[i]=a[i-1]*i%MOD;return a;}
//Vi stpow = stpowV(); // 階乗配列(%MOD)

/****************************** START ******************************/

struct UnionFind {
  
  vector<int> par;
  vector<int> siz;
  
  UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
    for(int i = 0; i < N; i++) par[i] = i;
    siz = Vi(N,1);
  }

  int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
    if (par[x] == x) return x;
    return par[x] = root(par[x]);
  }

  void unite(int x, int y) { // xとyの木を併合
    int rx = root(x);
    int ry = root(y);
    if (rx == ry) return;
    if (siz[rx] < siz[ry]) swap(rx, ry);
    siz[rx] += siz[ry];
    par[ry] = rx;
  }

  bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
    int rx = root(x);
    int ry = root(y);
    return rx == ry;
  }
  
  int size(int x) { // 素集合のサイズ
    return siz[root(x)];
  }
};

struct RSAQ {
  
  
  
  vector<int> data;
  vector<int> bucket1;
  vector<int> bucket2;
  int sq;
  
  RSAQ(int n) {
    sq = sqrt(n);
    if(sq*sq==n) sq--;
    sq++;
    data = Vi(sq*sq,0);
    bucket1 = Vi(sq,0); // 1はRAQ成分(0)
    bucket2 = Vi(sq,0); // 2はRSQ成分(0)
  }
  
  void radd(int L,int R,int k) { // [L,R]は範囲
    R++;
    int dL,dR;
    
    rep(i,0,sq+1) {
      dL = i*sq,dR = (i+1)*sq; // [dL,dR]は小範囲(バケット)
      
      if(dR <= L || R <= dL) continue; // バケットが完全に範囲外
      
      if(L <= dL && dR <= R) { // バケットが完全に範囲内
        bucket1[i] += k;
      }
      
      else { // バケットが範囲と一部重なる
        rep(j,max(L,dL),min(R,dR)) {
          data[j] += k;
          bucket2[i] += k;
        }
      }
    }
  }
  
  void add(int i,int k) {
    radd(i,i,k);
    return;
  }
  
  int at(int i) {
    int ib = i/sq;
    return data[i]+bucket1[ib];
  }
  
  void update(int i,int k) {
    int now = at(i);
    add(i,k-now);
    return;
  }
  
  int rsum(int L,int R) {
    R++;
    int sum = 0;
    int dL,dR;
    
    rep(i,0,sq+1) {
      dL = i*sq,dR = (i+1)*sq; // [dL,dR]は小範囲
      
      if(dR <= L || R <= dL) continue; // 小範囲が完全に範囲外
      
      if(L <= dL && dR <= R) { // 小範囲が完全に範囲内
        sum += bucket2[i];
        sum += bucket1[i]*sq;
      }
      
      else { // 小範囲が範囲と一部重なる
        rep(j,max(L,dL),min(R,dR)) {
          sum += data[j]+bucket1[i];
        }
      }
    }
    return sum;
  }
  
  void debug() {
    //Verr(data);
    //Verr(bucket1);
    //Verr(bucket2);
    //cerr << endl;
  }
  
};

signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  int n;
  cin >> n;
  
  int ans = 0;
  repeq(i,1,n){
    ans += (i)*(n+1-i);
  }
  rep(i,0,n-1){
    int qw,er;
    cin >> qw >> er;
    if(qw > er) swap(qw,er);
    ans -= (n-er+1)*(qw);
  }
  cout << ans << endl;
  /*
  //UnionFind tree(n);
  VVi gr(n);
  Vi par(n,INF);
  
  int qw,er;
  int nowsize = 0;
  rep(i,0,n-1){
    cin >> qw >> er;
    qw--,er--;
    if(qw > er) swap(qw,er);
    gr[er].pb(qw);
    par[qw] = min(par[qw],er);
  }
  //cout << par << endl << endl;
  
  Vi si(n);
  rep(i,0,n){
    if(gr[i].size()==0){
      nowsize++;
      si[i] = nowsize;
      continue;
    }
    else {
      nowsize += 1 - gr[i].size();
      si[i] = nowsize;
    }
  }
  
  RSAQ vec(n);
  rep(i,0,n){
    vec.add(i,si[i]);
  }
  int ans = 0;
  rep(i,0,n){
    rep(i,0,n){
      cerr << vec.at(i) <<' ';
    }
    cerr << endl;
    ans += vec.rsum(0,n-1);
    if(par[i]==INF){
      vec.update(i,0);
    }
    else {
      vec.radd(i,par[i]-1,-1);
    }
    
    
  }
  cout << ans << endl;
  */
  /*　使い方まとめ(0-index)　*/
  
  /*
  
  RMUQ myvec(n) // 宣言 nは必要な要素数
  myvec.at(i) // 配列のi番目にアクセス
  myvec.update(i,k) // 配列のi番目をkにする
  myvec.add(i,k) // 配列のi番目にkを足す
  myvec.radd(L,R,k) // 配列のL番目からR番目にkを足す
  myvec.rsum(i,j) // 配列の[i,j]の範囲の和を返す
  
  myvec.debug() // 元データ配列とバケット配列を標準エラー出力
  
  */
  return 0;
}

Measured memory_bytes: 3656