#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=2001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi parent,rankk,sz;
vb s;
void init(ll n){
    parent=vi(n);
    rankk=vi(n);
    sz=vi(n,1);
    s=vb(n,false);
    rep(i,n)parent[i]=i;
}
ll root(ll i){if(parent[i]==i)return i;return root(parent[i]);}
ll getsize(ll i){return sz[root(i)];}
bool same(ll a,ll b){return root(a)==root(b);}
bool heigou(ll x,ll y){
    x=root(x);y=root(y);
    if(x==y){
        s[x]=true;
        return false;
    }
    if(rankk[x]<rankk[y]){parent[x]=y;sz[y]+=sz[x];if(s[x])s[y]=true;}
    else{parent[y]=x;sz[x]+=sz[y];if(s[y])s[x]=true;}
    if(rankk[x]==rankk[y])rankk[x]++;
    return true;
}
vi color;
vvi g;
bool is_nibu=true;
void dfs(int i,int c){
    if(!is_nibu)return;
    if(color[i]==c)return;
    if(color[i]!=-1){
        is_nibu=false;
        return;
    }
    color[i]=c;
    for(auto x:g[i]){
        if(color[x]!=1-c)dfs(x,1-c);
    }
}
int main(){
    ll n,m;cin>>n>>m;
    ll ans=0;
    vp hen(m);
    g=vvi(n);
    init(n);
    rep(i,m){
        ll a,b;cin>>a>>b;
        heigou(a-1,b-1);
        g[a-1].pb(b-1);
        g[b-1].pb(a-1);
    }
    vb used(n,false);
    ll N=n,sum=0;
    color=vi(n,-1);
    rep(i,n)if(!used[root(i)]){
        ll x=root(i);
        used[x]=true;
        if(sz[x]==1)N--;
        else{
            is_nibu=true;
            dfs(x,0);
            ans++;
            if(is_nibu)sum++;
        }
    }
    out(ans*ans+sum*sum+n*n-N*N);
}

Measured memory_bytes: 15104