// #pragma GCC optimize("Ofast,unroll-loops")

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <locale>
#include <map>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
#include <chrono>

using namespace std;

#define          BIT(i,j)  (((i)>>(j))&1LL)
#define           MASK(i)  (1LL<<(i))
#define            ALL(x)  (x).begin(),(x).end()
#define             SZ(x)  (int)(x).size()
#define                fi  first
#define                se  second
#define               ull  unsigned long long
#define                ll  long long
#define                ld  long double
#define                vi  vector<int>
#define               vvi  vector<vi>
#define              vvvi  vector<vvi>
#define               pii  pair<int,int>
#define              vpii  vector<pii>
#define             vvpii  vector<vpii>
#define              endl  "\n"
#define                MP  make_pair
#define               int  ll

//------------------------------------------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
//-----------------------------------------------------------------------------------------------//
const  ll   LINF = 1e18;
const int    INF = 1e9;
const int    LOG = 20;
const int   MAXN = 5e5+7;
const int      N = 1e2+3;
const int    MOD = 1e9+7;
const int   BASE = 1e5;
const  ld    EPS = 1e-9;
const  ld     PI = acos(-1);
const int OFFSET = 1e3;
//------------------------------------------------------------------------------------------------//

void add(int &a, int b){
    a += b;
    if(a>=MOD) a -= MOD;
    if(a<0) a += MOD;
}

struct segment_tree{
    vi lazy,st;
    int n;

    void pushdown(int id, int l, int r){
        if(lazy[id]==0 || l==r) return ;
        int mid = (l+r)>>1;
        add(st[id<<1],1LL*lazy[id]*(mid-l+1)%MOD);
        add(st[id<<1|1],1LL*lazy[id]*(r-mid)%MOD);
        add(lazy[id<<1],lazy[id]);
        add(lazy[id<<1|1],lazy[id]);
        lazy[id] = 0;
    }

    void update(int id, int l, int r, int lo, int hi, int val){
        if(l>hi || r<lo) return ;
        if(l>=lo && r<=hi){
            add(st[id],1LL*val*(r-l+1)%MOD);
            add(lazy[id],val);
            return ;
        }
        pushdown(id,l,r);
        int mid = (l+r)>>1;
        update(id<<1,l,mid,lo,hi,val);
        update(id<<1|1,mid+1,r,lo,hi,val);
        st[id] = st[id<<1];
        add(st[id],st[id<<1|1]);
    }

    int get(int id, int l, int r, int lo, int hi){
        if(l>hi || r<lo) return 0;
        if(l>=lo && r<=hi) return st[id];
        pushdown(id,l,r);
        int mid = (l+r)>>1;
        int res = get(id<<1,l,mid,lo,hi);
        add(res,get(id<<1|1,mid+1,r,lo,hi));
        return res;
    }

    void update(int l, int r, int val){
        update(1,1,n,l,r,val);
    }

    int get(int l, int r){
        return get(1,1,n,l,r);
    }

    segment_tree(int _n = 0):n(_n){
        lazy.assign(n<<2|1,0);
        st.assign(n<<2|1,0);
    }
};

struct DSU{
    vi mx,par,s;
    int n;

    int find(int u){
        return par[u]==u?u:par[u]=find(par[u]);
    }

    int get_max(int u){
        return mx[find(u)];
    }

    bool unite(int u, int v){
        u = find(u); v = find(v);
        if(u==v) return false;
        if(s[u]<s[v]) swap(u,v);
        maxi(mx[u],mx[v]);
        s[u] += s[v];
        par[v] = u;
        return true;
    }

    DSU(int _n = 0):n(_n){
        par.resize(n+3); iota(ALL(par),0);
        mx.resize(n+3); iota(ALL(mx),0);
        s.assign(n+3,1);
    }
};

vpii his;
vi adj[MAXN],g[MAXN];
int dp[MAXN],child[MAXN],pos[MAXN],par[MAXN],dep[MAXN],chain[MAXN];
int timers = 0;
segment_tree seg1,seg2;

void dfs(int u, int p){
    child[u] = 1;
    for(int &v:g[u]){
        if(v==p) continue;
        dep[v] = dep[u]+1;
        dfs(v,u);
        child[u] += child[v];
    }
}

void hld(int u, int p, int h){
    pos[u] = ++timers;
    chain[u] = h;
    par[u] = p;
    int siz = -1,id = -1;
    for(int &v:g[u]){
        if(v==p) continue;
        if(maxi(siz,child[v])){
            id = v;
        }
    }
    if(id==-1) return ;
    hld(id,u,h);
    for(int &v:g[u]){
        if(v==p || v==id) continue;
        hld(v,u,v);
    }
}

int get(int u, int v){
    int res = 0;
    while(chain[u]!=chain[v]){
        if(dep[v]>dep[u]){
            int l = 0,r = pos[v]-pos[chain[v]],ans = -1;
            while(l<=r){
                int mid = (l+r)>>1;
                if(seg2.get(pos[v]-mid,pos[v])>0){
                    r = mid-1;
                }else{
                    ans = mid;
                    l = mid+1;
                }
            }
            if(ans!=-1){
                add(res,seg1.get(pos[v]-ans,pos[v]));
                seg2.update(pos[v]-ans,pos[v],1);
                his.emplace_back(pos[v]-ans,pos[v]);
            }
            v = par[chain[v]];
        }else{
            int l = 0,r = pos[u]-pos[chain[u]],ans = -1;
            while(l<=r){
                int mid = (l+r)>>1;
                if(seg2.get(pos[u]-mid,pos[u])>0){
                    r = mid-1;
                }else{
                    ans = mid;
                    l = mid+1;
                }
            }
            if(ans!=-1){
                add(res,seg1.get(pos[u]-ans,pos[u]));
                seg2.update(pos[u]-ans,pos[u],1);
                his.emplace_back(pos[u]-ans,pos[u]);
            }
            u = par[chain[u]];
        }
    }
    if(dep[u]!=dep[v]){
        if(dep[u]>dep[v]) swap(u,v);
        int l = 0,r = pos[v]-pos[chain[v]],ans = -1;
        while(l<=r){
            int mid = (l+r)>>1;
            if(seg2.get(pos[v]-mid,pos[v])>0){
                r = mid-1;
            }else{
                ans = mid;
                l = mid+1;
            }
        }
        if(ans!=-1){
            add(res,seg1.get(pos[v]-ans,pos[v]));
            seg2.update(pos[v]-ans,pos[v],1);
            his.emplace_back(pos[v]-ans,pos[v]);
        }
    }
    return res;
}

void solve(){
    int n,m; cin >> n >> m;
    for(int i = 1; i<=m; i++){
        int u,v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    DSU dsu(n);
    for(int u = 1; u<=n; u++){
        set<int> s;
        for(int &v:adj[u]){
            if(v>u) continue;
            s.insert(dsu.get_max(v));
        }
        for(int v:s){
            g[u].push_back(v);
            g[v].push_back(u);
            // cout << u << " " << v << endl;
        }
        for(int &v:adj[u]){
            if(v>u) continue;
            dsu.unite(u,v);
        }
    }
    seg1 = segment_tree(n);
    seg2 = segment_tree(n);
    dfs(n,0);
    hld(n,0,n);
    // return ;
    // chain[0] = n;
    int res = 0;
    for(int u = 1; u<=n; u++){
        dp[u] = 1;
        for(int &v:adj[u]){
            if(v>u) continue;
            // v<u do
            add(dp[u],get(u,v));
        }
        seg1.update(pos[u],pos[u],dp[u]);
        for(auto &&[l,r]:his){
            seg2.update(l,r,-1);
        }
        // cerr << seg2.get(1,n) << " ";
        assert(seg2.get(1,n)==0);
        his.clear();
        add(res,dp[u]);
    }
    cout << res;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define task "test"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    #define task1 "nothing"
    if(fopen(task1".inp","r")){
        freopen(task1".inp","r",stdin);
        freopen(task1".out","w",stdout);
    }

    int test = 1;

    while(test--){
        solve();
    }
    cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
    return 0;
}

/**  /\_/\
 *  (= ._.)
 *  / >TL \>AC
**/