3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2;
const double inf = 1e18 + 7;
int ar[N], sz[N], dist[N], ver = N;
vector<pair<int, int> > adj[N];
double ans = inf, deri[N], pot;
bool used[N];
void dfs(int x, int p) {
  sz[x] = 1;
  for (auto i : adj[x]) {
    if (used[i.first] || i.first == p) {
      continue;
    }
    dfs(i.first, x);
    sz[x] += sz[i.first];
  }
}
int findcen(int x, int p, int siz) {
  for (auto i : adj[x]) {
    if (used[i.first] || i.first == p) {
      continue;
    }
    if (sz[i.first] > siz / 2) {
      return findcen(i.first, x, siz);
    }
  }
  return x;
}
void dfs1(int x, int p, int from) {
  deri[from] += sqrt(dist[x]) * 3.0 / 2 * ar[x];
  pot += 1.0 * sqrt(dist[x]) * dist[x] * ar[x];
  for (auto i : adj[x]) {
    if (i.first == p) {
      continue;
    }
    dist[i.first] = dist[x] + i.second;
    dfs1(i.first, x, from);
  }
}
void centroid(int x, int siz) {
  dfs(x, x);
  int cen = findcen(x, x, siz);
  dfs(cen, cen);
  used[cen] = true;
  double sumd = 0;
  pot = 0;
  for (auto i : adj[cen]) {
    dist[i.first] = i.second;
    deri[i.first] = 0;
    dfs1(i.first, cen, i.first);
    sumd += deri[i.first];
  }
  if (pot < ans) {
    ans = pot;
    ver = cen;
  }
  for (auto i : adj[cen]) {
    if (sumd - 2 * deri[i.first] < 0 && !used[i.first]) {
      centroid(i.first, sz[i.first]);
    }
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, i, j, k, l, m;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  for (i = 1; i < n; i++) {
    cin >> j >> k >> l;
    adj[j].push_back({k, l});
    adj[k].push_back({j, l});
  }
  centroid(1, n);
  cout << ver << ' ' << fixed << setprecision(15) << ans;
}
