#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const int N = 61;
int n, l[N], r[N], w[N];

void update(map<i64, int> &mp, i64 a, int b) {
    if(!mp.count(a)) mp[a] = b;
    else if(mp[a] < b) mp[a] = b;
}

int main() {
    cin >> n;
    for(int i = 0; i < n; i ++) cin >> l[i] >> r[i];
    for(int i = 1; i <= n; i ++) cin >> w[i];

    map<i64, int> mp;
    mp[0] = 0;

    for(int i = 1; i <= n; i ++) {
        vector<int> v;
        for(int j = 0; j < n; j ++) if(l[j] <= i && i <= r[j]) v.push_back(j);
        sort(v.begin(), v.end(), [](int a, int b) {return r[a] < r[b];});
        map<i64, int> nxt;
        for(auto [idx, val] : mp) {
            update(nxt, idx, val);
            int cnt = 0;
            i64 k = idx;
            for(int x : v) {
                if(!((idx >> x) & 1)) { 
                    k |= 1ll << x;
                    cnt ++;
                    if(cnt == i) {
                        cnt = 0;
                        update(nxt, k, val + w[i]);
                    }
                }
            }
        }
        swap(nxt, mp);
    }
    if(mp.count((1ll << n) - 1)) cout << mp[(1ll << n) - 1];
    else cout << "impossible";
}