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>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using ld = long double;
const int N = 2e5 + 1;
const int LG = 18;
int n;
int w[N];
vector<pii> g[N];
int dep[N];
int ps[N];
int tmp;
int lg[2 * N];
int st[LG][2 * N];
bool was[N];
int s[N];
void dfs(int v, int p) {
  ps[v] = tmp;
  st[0][tmp++] = dep[v];
  for (auto e : g[v]) {
    int to = e.first;
    if (to != p) {
      dep[to] = dep[v] + e.second;
      dfs(to, v);
      st[0][tmp++] = dep[v];
    }
  }
}
int dist(int u, int v) {
  int i = ps[u], j = ps[v];
  if (i > j) swap(i, j);
  int l = lg[j - i + 1];
  return dep[u] + dep[v] - 2 * min(st[l][i], st[l][j - (1 << l) + 1]);
}
void cs(int v, int p) {
  s[v] = 1;
  for (auto e : g[v]) {
    int to = e.first;
    if (to != p && !was[to]) {
      cs(to, v);
      s[v] += s[to];
    }
  }
}
int gc(int v, int p, int n) {
  for (auto e : g[v]) {
    int to = e.first;
    if (to != p && !was[to] && 2 * s[to] >= n) {
      return gc(to, v, n);
    }
  }
  return v;
}
ld kekfs(int v, int p, int base) {
  int d = dist(v, base);
  ld ret = sqrt((ld)d) * d * w[v];
  for (auto e : g[v]) {
    int to = e.first;
    if (to != p) {
      ret += kekfs(to, v, base);
    }
  }
  return ret;
}
int av = -1;
ld ans;
void cent(int v, int p) {
  cs(v, -1);
  v = gc(v, -1, s[v]);
  was[v] = true;
  ld cur = 0;
  int nxt = -1;
  ld mx = 0;
  for (auto e : g[v]) {
    int to = e.first;
    ld me = kekfs(to, v, v);
    cur += me;
    if (me > mx) {
      mx = me;
      nxt = to;
    }
  }
  if (av == -1 || cur < ans) {
    ans = cur;
    av = v;
  }
  if (nxt != -1 && !was[nxt]) {
    cent(nxt, v);
  }
}
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
  }
  for (int i = 0; i < n - 1; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    --u;
    --v;
    g[u].push_back({v, w});
    g[v].push_back({u, w});
  }
  dfs(0, -1);
  for (int i = 2; i <= tmp; i++) {
    lg[i] = 1 + lg[i >> 1];
  }
  for (int j = 1; j < LG; j++) {
    for (int i = 0; i + (1 << j) - 1 < tmp; i++) {
      st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
    }
  }
  cent(0, -1);
  cout.precision(10);
  cout << fixed;
  cout << av + 1 << ' ' << ans;
}
