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;
vector<array<int, 2> > g[N];
bool used[N];
int s[N];
void sizes(int v, int p) {
  s[v] = 1;
  for (auto u : g[v]) {
    if (u[0] == p || used[u[0]]) continue;
    sizes(u[0], v);
    s[v] += s[u[0]];
  }
}
int centroid(int v, int p, int n) {
  for (auto u : g[v]) {
    if (used[u[0]] || u[0] == p) continue;
    if (s[u[0]] > (n >> 1)) return centroid(u[0], v, n);
  }
  return v;
}
const int LOG = 18;
long long sum_w[N];
int w[N];
void dfs0(int v, int p) {
  sum_w[v] = w[v];
  for (auto u : g[v]) {
    if (used[u[0]] || p == u[0]) continue;
    dfs0(u[0], v);
    sum_w[v] += sum_w[u[0]];
  }
}
long double calc_ans(int v, int p, long long d) {
  long double ans = w[v] * d * sqrt((long double)d);
  for (auto u : g[v]) {
    if (u[0] == p) {
      continue;
    }
    ans += calc_ans(u[0], v, d + u[1]);
  }
  return ans;
}
pair<long double, int> ans = {numeric_limits<long double>::infinity(), -1};
void solve(int v) {
  ans = min(ans, make_pair(calc_ans(v, -1, 0), v));
  dfs0(v, -1);
  sizes(v, -1);
  used[v] = 1;
  pair<long double, int> mx_sz = {-1L, -1};
  for (auto u : g[v]) {
    if (used[u[0]]) continue;
    mx_sz = max(mx_sz, pair<long double, int>{(long double)sum_w[u[0]], u[0]});
  }
  int u = mx_sz.second;
  if (u >= 0) {
    int c = centroid(u, -1, s[u]);
    solve(c);
  }
}
mt19937 gen(229);
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> w[i];
  }
  for (int i = 1; i < n; ++i) {
    int a, b, l;
    cin >> a >> b >> l;
    --a;
    --b;
    g[a].push_back({b, l});
    g[b].push_back({a, l});
  }
  for (int i = 0; i < n; ++i) {
    shuffle(g[i].begin(), g[i].end(), gen);
  }
  sizes(0, -1);
  solve(centroid(0, -1, s[0]));
  cout << ans.second + 1 << ' ' << fixed << setprecision(20) << ans.first;
  return 0;
}
